Dynamic Aggregation of Set-Partitioning Constraints in Column Generation
From MaRDI portal
Publication:5322124
DOI10.1287/OPRE.1050.0222zbMATH Open1165.90604OpenAlexW2159784590MaRDI QIDQ5322124FDOQ5322124
Authors: Daniel Villeneuve, François Soumis, Guy Desaulniers, Issmail Elhallaoui
Publication date: 18 July 2009
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/55fc14068025f8c9374a55a821eeb756c6057c7d
Recommendations
- Bi-dynamic constraint aggregation and subproblem reduction
- Multi-phase dynamic constraint aggregation for set partitioning type problems
- Dynamic constraint and variable aggregation in column generation
- Stabilized dynamic constraint aggregation for solving set partitioning problems
- Distributed integral column generation for set partitioning problems
Cited In (40)
- Improved primal simplex: a more general theoretical framework and an extended experimental analysis
- Exact approaches for integrated aircraft fleeting and routing at TunisAir
- Stabilized Column Generation Via the Dynamic Separation of Aggregated Rows
- Dynamic constraint aggregation for solving very large-scale airline crew pairing problems
- Solving the patient admission scheduling problem using constraint aggregation
- Bi-dynamic constraint aggregation and subproblem reduction
- Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints
- All-integer column generation for set partitioning: basic principles and extensions
- Searching for optimal integer solutions to set partitioning problems using column generation
- Divide-and-price: a decomposition algorithm for solving large railway crew scheduling problems
- Influence of the normalization constraint on the integral simplex using decomposition
- Dynamic constraint and variable aggregation in column generation
- Vector Space Decomposition for Solving Large-Scale Linear Programs
- Dual variable based fathoming in dynamic programs for column generation
- Complementary column generation and bounding approaches for set partitioning formulations
- A horizon decomposition approach for the capacitated lot-sizing problem with setup times
- A two-level approach to large mixed-integer programs with application to cogeneration in energy-efficient buildings
- A linear programming decomposition focusing on the span of the nondegenerate columns
- Set partitioning and column generation heuristics for capacitated dynamic lotsizing
- The minimum mean cycle-canceling algorithm for linear programs
- Constraint Aggregation in Column Generation Models for Resource-Constrained Covering Problems
- A new version of the improved primal simplex for degenerate linear programs
- The positive edge pricing rule for the dual simplex
- Multi-phase dynamic constraint aggregation for set partitioning type problems
- Integrated airline crew scheduling: a bi-dynamic constraint aggregation method using neighborhoods
- Column generation decomposition with the degenerate constraints in the subproblem
- A new modeling and solution approach for the set-partitioning problem
- A dynamic driver management scheme for less-than-truckload carriers
- Optimized load planning for motorail transportation
- Column generation bounds for numerical microaggregation
- Valid Inequalities and Separation Algorithms for the Set Partitioning Problem
- Distributed integral column generation for set partitioning problems
- Arc flow formulations based on dynamic programming: theoretical foundations and applications
- A column generation approach for solving the patient admission scheduling problem
- Dynamic penalization of fractional directions in the integral simplex using decomposition: application to aircrew scheduling
- Resource extension functions: properties, inversion, and generalization to segments
- Alternating Lagrangian decomposition for integrated airline crew scheduling problem
- Row-reduced column generation for degenerate master problems
- A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports
- Stabilized dynamic constraint aggregation for solving set partitioning problems
This page was built for publication: Dynamic Aggregation of Set-Partitioning Constraints in Column Generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5322124)