COMPACT FORMULATION OF MULTICOMMODITY NETWORK FLOWS WITH APPLICATIONS TO THE BACKHAUL PROFIT MAXIMIZATION PROBLEM AND FIXED CHARGE NETWORK FLOW PROBLEM

The triples formulation is a compact formulation of multicommodity network flow problems that provides a different representation of flow than the traditional and widely used node-arc and arc-path approaches. In the literature, the triples formulation has been applied successfully to the maximum concurrent flow problem and to a network optimization problem with piecewise linear convex costs. This dissertation applies the triples formulation to the backhaul profit maximization problem (BPMP) and the fixed charge network flow problem (FCNF). It is shown that the triples representation of multicommodity flow significantly reduces the number of variables and constraints in the mixed integer programming formulations of the BPMP and FCNF. For the BPMP, this results in significantly faster solution times. For dense problem instances, the triples-based formulation of FCNF is found to produce better solutions than the node-arc formulation early in the branch-and-bound process. This observation leads to an effective hybrid method which combines the respective advantages of the smaller size of the triples formulation and the stronger linear programming relaxation of the node-arc formulation. In addition to empirical studies, the dissertation presents new theoretical results supporting the equivalence of the triples formulation to the node-arc and arc-path formulations. The dissertation also proposes a multi-criteria Composite Index Method (CIM) to compare the performance of alternative integer programming formulations of an optimization problem. Using the CIM, the decision maker assigns weights to problem instance sizes and multiple performance measures based on their relative importance for the given application. The weighting scheme is used to produce a single number that measures the relative improvement of one alternative over the other and provides a method to select the most effective approach when neither one dominates the other when tested on different sizes of problem instances. The dissertation demonstrates a successful application of the CIM to evaluate a series of eleven techniques for improving the node-arc and triples formulations of the BPMP previously proposed in the literature

Advanced planning systems for hard disk drive assembly

Ph.DDOCTOR OF PHILOSOPH

Dimensionerings- en werkverdelingsalgoritmen voor lambda grids

Grids bestaan uit een verzameling reken- en opslagelementen die geografisch verspreid kunnen zijn, maar waarvan men de gezamenlijke capaciteit wenst te benutten. Daartoe dienen deze elementen verbonden te worden met een netwerk. Vermits veel wetenschappelijke applicaties gebruik maken van een Grid, en deze applicaties doorgaans grote hoeveelheden data verwerken, is het noodzakelijk om een netwerk te voorzien dat dergelijke grote datastromen op betrouwbare wijze kan transporteren. Optische transportnetwerken lenen zich hier uitstekend toe. Grids die gebruik maken van dergelijk netwerk noemt men lambda Grids. Deze thesis beschrijft een kader waarin het ontwerp en dimensionering van optische netwerken voor lambda Grids kunnen beschreven worden. Ook wordt besproken hoe werklast kan verdeeld worden op een Grid eens die gedimensioneerd is. Een groot deel van de resultaten werd bekomen door simulatie, waarbij gebruik gemaakt wordt van een eigen Grid simulatiepakket dat precies focust op netwerk- en Gridelementen. Het ontwerp van deze simulator, en de daarbijhorende implementatiekeuzes worden dan ook uitvoerig toegelicht in dit werk

An Algorithmic View on Sensor Networks - Surveillance, Localization, and Communication

This thesis focuses on scalability issues of diverse problems on sensor networks and presents efficient solutions. First, we show that it is NP-hard to find optimal activation schedules for monitoring areas and provide an EPTAS algorithm. Second, we present a distributed algorithm for the detection of network boundaries that only requires local connectivity information. Finally, we introduce an FPTAS for computing shortest paths and describe an algorithm for determining alternative routes

Summary of Research 1994

The views expressed in this report are those of the authors and do not reflect the official policy or position of the Department of Defense or the U.S. Government.This report contains 359 summaries of research projects which were carried out under funding of the Naval Postgraduate School Research Program. A list of recent publications is also included which consists of conference presentations and publications, books, contributions to books, published journal papers, and technical reports. The research was conducted in the areas of Aeronautics and Astronautics, Computer Science, Electrical and Computer Engineering, Mathematics, Mechanical Engineering, Meteorology, National Security Affairs, Oceanography, Operations Research, Physics, and Systems Management. This also includes research by the Command, Control and Communications (C3) Academic Group, Electronic Warfare Academic Group, Space Systems Academic Group, and the Undersea Warfare Academic Group

A framework for efficient execution of matrix computations

Matrix computations lie at the heart of most scientific computational tasks. The solution of linear systems of equations is a very frequent operation in many fields in science, engineering, surveying, physics and others. Other matrix operations occur frequently in many other fields such as pattern recognition and classification, or multimedia applications. Therefore, it is important to perform matrix operations efficiently. The work in this thesis focuses on the efficient execution on commodity processors of matrix operations which arise frequently in different fields.We study some important operations which appear in the solution of real world problems: some sparse and dense linear algebra codes and a classification algorithm. In particular, we focus our attention on the efficient execution of the following operations: sparse Cholesky factorization; dense matrix multiplication; dense Cholesky factorization; and Nearest Neighbor Classification.A lot of research has been conducted on the efficient parallelization of numerical algorithms. However, the efficiency of a parallel algorithm depends ultimately on the performance obtained from the computations performed on each node. The work presented in this thesis focuses on the sequential execution on a single processor.There exists a number of data structures for sparse computations which can be used in order to avoid the storage of and computation on zero elements. We work with a hierarchical data structure known as hypermatrix. A matrix is subdivided recursively an arbitrary number of times. Several pointer matrices are used to store the location ofsubmatrices at each level. The last level consists of data submatrices which are dealt with as dense submatrices. When the block size of this dense submatrices is small, the number of zeros can be greatly reduced. However, the performance obtained from BLAS3 routines drops heavily. Consequently, there is a trade-off in the size of data submatrices used for a sparse Cholesky factorization with the hypermatrix scheme. Our goal is that of reducing the overhead introduced by the unnecessary operation on zeros when a hypermatrix data structure is used to produce a sparse Cholesky factorization. In this work we study several techniques for reducing such overhead in order to obtain high performance.One of our goals is the creation of codes which work efficiently on different platforms when operating on dense matrices. To obtain high performance, the resources offered by the CPU must be properly utilized. At the same time, the memory hierarchy must be exploited to tolerate increasing memory latencies. To achieve the former, we produce inner kernels which use the CPU very efficiently. To achieve the latter, we investigate nonlinear data layouts. Such data formats can contribute to the effective use of the memory system.The use of highly optimized inner kernels is of paramount importance for obtaining efficient numerical algorithms. Often, such kernels are created by hand. However, we want to create efficient inner kernels for a variety of processors using a general approach and avoiding hand-made codification in assembly language. In this work, we present an alternative way to produce efficient kernels automatically, based on a set of simple codes written in a high level language, which can be parameterized at compilation time. The advantage of our method lies in the ability to generate very efficient inner kernels by means of a good compiler. Working on regular codes for small matrices most of the compilers we used in different platforms were creating very efficient inner kernels for matrix multiplication. Using the resulting kernels we have been able to produce high performance sparse and dense linear algebra codes on a variety of platforms.In this work we also show that techniques used in linear algebra codes can be useful in other fields. We present the work we have done in the optimization of the Nearest Neighbor classification focusing on the speed of the classification process.Tuning several codes for different problems and machines can become a heavy and unbearable task. For this reason we have developed an environment for development and automatic benchmarking of codes which is presented in this thesis.As a practical result of this work, we have been able to create efficient codes for several matrix operations on a variety of platforms. Our codes are highly competitive with other state-of-art codes for some problems

Energy: A continuing bibliography with indexes, issue 38

This bibliography lists 1367 reports, articles and other documents introduced into the NASA scientific and technical information system from April 1, 1983 through June 30, 1983

Друга міжнародна конференція зі сталого майбутнього: екологічні, технологічні, соціальні та економічні питання (ICSF 2021). Кривий Ріг, Україна, 19-21 травня 2021 року

Second International Conference on Sustainable Futures: Environmental, Technological, Social and Economic Matters (ICSF 2021). Kryvyi Rih, Ukraine, May 19-21, 2021.Друга міжнародна конференція зі сталого майбутнього: екологічні, технологічні, соціальні та економічні питання (ICSF 2021). Кривий Ріг, Україна, 19-21 травня 2021 року