Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 20 for “"multicommodity"”.
-
Maximum Flows in Unit-Capacitated Multicommodity Trees
Multicommodity flows are studied, in the special case where the underlying graph is a tree and all arc capacities are one.
-
Topics in Combinatorial Algorithms (Multicommodity Flows, Quadratic Programming)
This thesis is a study of a wide variety of combinatorial optimization problems.
-
Approximation algorithms for multicommodity flow and shop scheduling problems
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1992.
-
Paradoxical Resolutions: James Joyce and Contemporary American Fiction - Multicommodity Model
Made available in DSpace on 2014-12-12T21:09:54Z (GMT). No. of bitstreams: 1 8004303.pdf: 13993651 bytes, checksum: 4c0319bc27016ef44a95a2252eef0f2c (MD5) Previous issue date: 1979
-
An Evaluation of Japanese Agricultural Trade Policies With a Multiregion - Multicommodity Model
Made available in DSpace on 2014-12-13T19:23:29Z (GMT). No. of bitstreams: 1 8004304.pdf: 5316589 bytes, checksum: a2b56d4d81303855347aaef283d87a38 (MD5) Previous issue date: 1979
-
Scaling algorithms for multicommodity flow problems and network flow problems with side constraits
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Civil Engineering, 1991.
-
A Systems approach to planning large training operations for Army Units : visualization and optimization of multicommodity networks
… costs and time. Through the application of multicommodity modeling, a decrease of time and operating cost was achieved, 11.04% and 25.85% respectively. Additionally, future work may discover further benefits to increase resource management and speed of execution via the multicommodity flow …
-
A dynamic econometric-simulation model of the U.S. livestock industry
… to provide policy makers with detailed multicommodity models which are microcomputer based. These models offer high portability and rapid access to information and at the same time provide analysis of the direct and indirect economic impacts of policies as well as the resulting …
-
From graphs to matrices, and back : new techniques for graph algorithms
… of O(n3/2') running time on sparse graphs; -- Multicommodity Flow Problems. We set forth a new method of speeding up the existing approximation algorithms for multicommodity flow problems, and use it to obtain the fastest-known (1 - [epsilon])-approximation algorithms for these problems. These …
-
Diastolic arrays : throughput-driven reconfigurable computing
… time by formulating it as a maximum concurrent multicommodity flow problem and using linear programming. We show that the architecture of diastolic arrays enables efficient synthesis from high-level specifications of communicating finite state machines, providing a high-performance, …
-
Iterative methods, combinatorial optimization, and linear programming beyond the universal barrier
… including regression, generalized lossy flow, multicommodity flow, and more.
-
Conic optimization of electric power systems
… of NP-hard graph cut arising from undirected multicommodity flow networks. An eigenvalue bound in the form of the Cheeger inequality is proven, which serves as a starting point for deriving semidefinite relaxations. We next apply a lift-and-project type relaxation to transmission system …
-
New models and solution algorithms for Hub Location and related problems
… Capítulo 5 introduce un nuevo Problema de Flujo Multicommodity en el que partes de las rutas de transporte son subcontratadas a proveedores externos. Esto puede modelarse como un problema binivel, el cual se muestra que es NP-duro incluso sin restricciones explícitas de capacidad. Desarrollamos …
-
Optimization and network sensitivity analysis for process retrofitting
… The representation of the flowsheet as a multicommodity network allows the use of a graph based algorithm to determine the cycles in the process and apply flow decomposition by techniques developed in this study. Flow decomposition determines the path and cycles by which commodities …
-
Approximation algorithms for submodular optimization and graph problems
… the gap between fractional and integral multicommodity flows. We give a poly-logarithmic approximation with constant congestion for the node-disjoint paths problem and we show a poly-logarithmic upper bound on the gap between the maximum fractional and integral throughput flows in …
-
Space logistics network optimization with embedded propulsion technology selection
… The second framework combines the generalized multicommodity network flow model with novel event-based time steps for dynamic space logistics optimization in the presence of nonlinear flight times associated with low-thrust transportation. These methodologies are applied to the case study of …
-
Efficient and robust resource allocation for network function virtualization
… maximum flow problem as a fractional multicommodity flow problem and develop a combinatorial algorithm for a special case of practical interest.
-
On practical metrics for network infrastructure reliability
The objective of civil infrastructure design is to provide the best service possible within execution constraints, for a given lifetime service. During this lifetime exceptional events occur which stress the working limits beyond regular performance and may even collapse functionality completely. …