Multi-phase dynamic constraint aggregation for set partitioning type problems
From MaRDI portal
Publication:964175
DOI10.1007/s10107-008-0254-5zbMath1189.90099MaRDI QIDQ964175
Guy Desaulniers, François Soumis, Abdelmoutalib Metrane, Issmail El Hallaoui
Publication date: 15 April 2010
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-008-0254-5
90C05: Linear programming
Related Items
A linear programming decomposition focusing on the span of the nondegenerate columns, Integrated airline crew scheduling: a bi-dynamic constraint aggregation method using neighborhoods, Divide-and-price: a decomposition algorithm for solving large railway crew scheduling problems, A new version of the improved primal simplex for degenerate linear programs, Dynamic constraint and variable aggregation in column generation, Integral simplex using decomposition with primal cutting planes, Modelling transfer line design problem via a set partitioning problem, Stabilized dynamic constraint aggregation for solving set partitioning problems, A column generation approach for solving the patient admission scheduling problem, Row-reduced column generation for degenerate master problems, Bi-dynamic constraint aggregation and subproblem reduction, Integral Simplex Using Decomposition for the Set Partitioning Problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Solving large-scale linear programs by aggregation
- On the solution of highly degenerate linear programmes
- Selected bibliography on degeneracy
- Pivot rules for linear programming: A survey on recent theoretical developments
- A basis-defiency-allowing variation of the simplex method for linear programming
- The generalized simplex method for minimizing a linear form under linear inequality restraints
- Aggregation and Disaggregation Techniques and Methodology in Optimization
- A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
- A Column Generation Approach to the Urban Transit Crew Scheduling Problem
- A practicable steepest-edge simplex algorithm
- An Iterative Aggregation Procedure for Markov Decision Processes
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- New Finite Pivoting Rules for the Simplex Method
- A New Degeneracy Method and Steepest-Edge--Based Conditioning for LP
- Solving Airline Crew Scheduling Problems by Branch-and-Cut
- Simultaneous Vehicle and Crew Scheduling in Urban Mass Transit Systems
- A Column Generation Approach for Large-Scale Aircrew Rostering Problems
- Dynamic Aggregation of Set-Partitioning Constraints in Column Generation
- A Technique for Resolving Degeneracy in Linear Programming
- Shortest Path Problems with Resource Constraints
- Surrogate Constraints
- Pivot selection methods of the Devex LP code
- Optimality and Degeneracy in Linear Programming