Dynamic Aggregation of Set-Partitioning Constraints in Column Generation
From MaRDI portal
Publication:5322124
DOI10.1287/opre.1050.0222zbMath1165.90604OpenAlexW2159784590MaRDI QIDQ5322124
Daniel Villeneuve, Guy Desaulniers, François Soumis, Issmail El Hallaoui
Publication date: 18 July 2009
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/55fc14068025f8c9374a55a821eeb756c6057c7d
Related Items (33)
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 ⋮ The positive edge pricing rule for the dual simplex ⋮ Optimized load planning for motorail transportation ⋮ Stabilized Column Generation Via the Dynamic Separation of Aggregated Rows ⋮ Dynamic constraint and variable aggregation in column generation ⋮ Alternating Lagrangian decomposition for integrated airline crew scheduling problem ⋮ Dynamic penalization of fractional directions in the integral simplex using decomposition: application to aircrew scheduling ⋮ Valid Inequalities and Separation Algorithms for the Set Partitioning Problem ⋮ 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 ⋮ Dynamic constraint aggregation for solving very large-scale airline crew pairing problems ⋮ A new modeling and solution approach for the set-partitioning problem ⋮ Column generation bounds for numerical microaggregation ⋮ Bi-dynamic constraint aggregation and subproblem reduction ⋮ Arc flow formulations based on dynamic programming: theoretical foundations and applications ⋮ Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints ⋮ Stabilized dynamic constraint aggregation for solving set partitioning problems ⋮ Searching for optimal integer solutions to set partitioning problems using column generation ⋮ Resource extension functions: properties, inversion, and generalization to segments ⋮ Multi-phase dynamic constraint aggregation for set partitioning type problems ⋮ A column generation approach for solving the patient admission scheduling problem ⋮ A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports ⋮ A dynamic driver management scheme for less-than-truckload carriers ⋮ Exact approaches for integrated aircraft fleeting and routing at TunisAir ⋮ Column generation decomposition with the degenerate constraints in the subproblem ⋮ Influence of the normalization constraint on the integral simplex using decomposition ⋮ A new version of the improved primal simplex for degenerate linear programs ⋮ Improved Primal Simplex: A More General Theoretical Framework and an Extended Experimental Analysis ⋮ Vector Space Decomposition for Solving Large-Scale Linear Programs ⋮ A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times ⋮ The minimum mean cycle-canceling algorithm for linear programs ⋮ Row-reduced column generation for degenerate master problems
This page was built for publication: Dynamic Aggregation of Set-Partitioning Constraints in Column Generation
