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 11 of 11 for “"network flow problem"”.
-
[Episilon]-relaxation and auction algorithms for the convex cost network flow problem
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1995.
-
A network-based primal-dual solution methodology for the multi-commodity network flow problem
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Civil Engineering, 1988.
-
Resilient and Risk-Averse Network Systems
… solution methodologies for graph-theoretical problems involving topologically stochastic information appearing in various forms. Weutilize a stochastic programming framework grounded in coherent risk measures to identify minimum-risk graph structures under stochastic vertex and/or edge …
-
A review of techniques in transportation research
… their operations is relatively new Some of the problems encountered in transportation research are discussed along with methods for their solution,. The Hitchcock distribution problem is discussed and a sample problem solved using three different methods. The usefulness of graph theory in …
-
Long-term scheduling in underground coal mining using mixed binary programming
… value. Defining the mine layout as a precedence network, with the nodes representing mining blocks, a solution procedure is developed, based on Benders' partitioning scheme. That is, the procedure iterates between two problems, namely, the master (primal) problem, solved by a combination of …
-
Distributed Energy-Saving Algorithms for Wireless Networks
The rapid growth of wireless networks has led to increasing interest in designing new algorithms that can efficiently reduce the energy consumption of routers and other devices. We present a new formulation of the Network Flow problem that takes into account the energy consumption of the data …
-
Weekly crew scheduling for freight rail engineers : a network approach
… and unpredictable work hours. The scheduling problem is formulated as a multi-commodity network flow problem on a directed time-space graph. Both the two-city and three-city cases are addressed. To account for the variability in trip times, a range of scenarios is defined in which demand is …
-
Resident Scheduling Problem
… thesis is concerned with the Resident Scheduling Problem (RSP) in which a good schedule is desired that will meet both departmental requirements and residents' preferences. Three scenarios that represent most situations and account for various departmental requirements and needs are described. …
-
Supply chain optimization : formulations and algorithms
… solution methods for a supply chain optimization problem: a multi-echelon, un capacitated, time-expanded network of distribution centers and stores, for which we seek the shipping schedule that minimizes total inventory, backlogging, and shipping costs, assuming deterministic, time-varying demand …
-
Novel Integer Optimization Methods and their Applications in Biomass Supply Chain and Power Dominating Set
Integer optimization (IO) problems arise in research areas and our daily life almost in every aspect. IO formulations and methods can be adopted to make optimal decisions for solution-searching and management with global optimization. Two main areas of applications of IO are studied in the …
-
Tactical Network Flow and Discrete Optimization Models and Algorithms for the Empty Railcar Transportation Problem
… equipment type, and to solve the distribution problem of repositioning empty multilevel autoracks of each type from points at which they are unloaded to automobile assembly facilities where they need to be reloaded. Each such problem is referred to in the railroad industry as a repositioning …