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 “"Row generation"”.
-
The application of recoverable robustness to airline planning problems
… are efficiently solved by integrating column generation and Benders' decomposition. The development of enhancement techniques is required to solve the large-scale optimisation problems resulting from large flight schedules and sets of disruption scenarios. In addition, the aircraft maintenance …
-
Multi-row approaches to cutting plane generation
… covered here is a fast separation method for two-row cuts. Two-row cuts are intersection cuts from two rows of a simplex tableau describing the LP relaxation of the problem. This type of cuts recently gathered a lot of attention from the scientific community following a paper by Andersen, …
-
Inventory routing for perishable products
… (MILP) formulations for the problem. A column-row generation algorithm to solve the LP-relaxation of the first formulation is developed. To solve the LP-relaxation of the second formulation, we develop a column generation algorithm. Details of two label-setting algorithms to solve the pricing …
-
Simulation Optimization of Intermodal Freight Transportation under Disruptions
Rapid growth in freight transportation in modern supply chains has led to increased operational costs, congestion, and severe environmental impacts, especially greenhouse gas emissions. Combining different modes, such as highway, railway, and waterway, intermodal transportation could thus offer …
-
Combinatorial optimization and application to DNA sequence analysis
… Along with this increase, there is a growing need to develop efficient algorithms to process such data in order to make useful and important discoveries. Careful analysis of genomic data will benefit science and society in numerous ways, including the understanding of protein sequence …
-
Two-person games for stochastic network interdiction : models, methods, and complexities
… have unit installation costs. We present a row-generation algorithm and a version of the weighted majority algorithm to solve such instances. We use an exact-penalty result to formulate a model in which some detectors are visible to the smuggler and others are not. This may be appropriate to …
-
Scheduling, inventory management and production planning: Formulations and solution methods
… model and develop an exact column-and-row generation algorithm to solve it. Based on computational results, we show that considering order modification can significantly reduce the total cost. Moreover, comparing the results obtained by the proposed robust model to those obtained from …
-
Integrated, Analytic and Utilization-based Models for Demand-centered Capacity Analysis in Complex Railway Networks
… with the use of mixed integer program (MIP) and row generation. The capacity is then determined by assessing the maximum utilization and the scheduled waiting times of the railway network with respect to infrastructure, railway operations and demand. We first introduce the definition of railway …
-
Copositive programming approaches for robust optimization and Löwner-John ellipsoid problems
… (LP). The number of constraints in the LP grows exponentially with the number of nodes. To solve this issue, we develop a row generation algorithm to solve the LP.
-
Selected Interdiction Games with Uncertain, Risk-Averse, and Simultaneous Play Considerations
… an exact method for this problem that utilizes row generation, partitioning, and bounding strategies. We demonstrate the efficacy of our approaches on randomly-generated instances. In the second problem, the follower aims to access the sink node without being detected by the leader. Both players …
-
MATHEMATICAL PROGRAMMING ALGORITHMS FOR NETWORK OPTIMIZATION PROBLEMS
… Tree Problem (KPCSTP): to implement a Column Generation algorithm for the MRWADC problem and for the HAP, we need also to solve the two corresponding pricing problems. These two problems are very similar, both of them require to find an arborescence, contained in a given directed weighted …