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 8 of 8 for “"Branch-and-Price Method"”.
-
The Slim Branch and Price Method with an Application to the Hamiltonian p-median Problem
… is to present a new exact optimization method, the Slim Branch and Price (SBP) method, which is an improvement over the traditional Branch and Price (B&P) framework. SBP can be used to solve a large class of combinatorial optimization problems that can be solved by B&P type algorithms …
-
Branch-and-Price Method for Stochastic Generalized Assignment Problem, Hospital Staff Scheduling Problem and Stochastic Short-Term Personnel Planning Problem
… dissertation has been focused on exploiting the branch-and-price (BNP) method for the solution of various stochastic mixed integer programming problems (MIPs). In particular, we address the stochastic generalized assignment problem (SGAP), a hospital staff scheduling problem (HSSP), a stochastic …
-
An implementation of a constraint branching algorithm for optimally solving airline crew pairing problems
… programs which can be solved exactly using branch-and-price methods. However, in practice, in order to find a good schedule expediently, the branch-and-price tree is often only partially explored. A constraint branching heuristic called connection fixing often selects branches containing …
-
Optimization-based resource allocation and transmission scheduling for wireless networks
… are expected to be more energy-efficient and to provide higher throughput, in order to satisfy the demands for the increasing number of mobile users. Resource allocation and transmission scheduling play more and more important roles in improving the performance of wireless networks, in …
-
Algorithms for weighted coloring problems
… weights of the vertices assigned to that color and equals the maximum of these weights. Furthermore, in WVCP, the adjacent vertices are assigned different colors, and the objective is to minimize the total cost of all the colors used. We studied WVCP and proposed an O(n^2 log n) time algorithm …
-
Data Driven Efficiency for E-Warehousing: Descriptive and Prescriptive Analytics
… company, we analyze the warehousing operation and its major processes of order picking and order consolidation. Without access to the actual layouts and process flow diagrams, we analyze the data to describe the processes in detail, and prescribe changes to improve the operation. We investigate …
-
Parallel machine scheduling with time windows
… application of interest involves the tracking and data relay satellite system (TDRSS) run by the U.S. National Aeronautics and Space Administration. This system acts as a relay platform for Earth-orbiting vehicles that wish to communicate periodically with ground stations. An additional feature …