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 9 of 9 for “"multicommodity flow"”.
-
Approximation algorithms for multicommodity flow and shop scheduling problems
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1992.
-
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.
-
From graphs to matrices, and back : new techniques for graph algorithms
… graph problems including: -- The Maximum s-t Flow and Minimum s-t Cut Problems. We develop a new approach to computing (1 - [epsilon])-approximately maximum s-t flow and (1 + [epsilon])-approximately minimum s-t cut in undirected graphs that gives the fastest known algorithms for these tasks. …
-
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, …
-
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 …
-
Iterative methods, combinatorial optimization, and linear programming beyond the universal barrier
… programming to linear system solving to maximum flow. Key results in this thesis include the following: -- Linear Programming: We provide the first general improvement to both the running time and convergence rate of polynomial time algorithms for solving linear programs in over 15 years. For a …
-
Conic optimization of electric power systems
… description of alternating current power flow: it is nonconvex, and thus excludes power systems from many frameworks benefiting from theoretically and practically efficient algorithms. However, advances over the past twenty years in optimization have led to broader classes possessing such …
-
On practical metrics for network infrastructure reliability
… provided by these networks in the form of flow ease, quality, and capacity.Network infrastructures are complex systems that can be readily represented as graph objects. Traditional literature classifies different approaches as topological, flow-based, or statistical as they try to recognize …
-
Efficient and robust resource allocation for network function virtualization
… of the VNF-nodes' resources to network flows. These two subproblems must be jointly considered to satisfy the objective of serving the maximum amount of traffic. We first consider this problem for the one-dimensional setting, where all network flows require one network function, which …