Bi-dynamic constraint aggregation and subproblem reduction

DOI10.1016/J.COR.2006.10.007MaRDI QIDQ2459403zbMATH OpenOpenAlexFDO

Authors Guy Desaulniers, François Soumis, Issmail Elhallaoui, Abdelmoutalib Metrane

Publication date 6 November 2007

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2006.10.007

zbMATH Keywords

column generationdegeneracydynamic constraint aggregationset partitioningsubproblem reduction

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• Multi-phase dynamic constraint aggregation for set partitioning type problems
• Dynamic Aggregation of Set-Partitioning Constraints in Column Generation
• Dynamic constraint and variable aggregation in column generation
• Stabilized dynamic constraint aggregation for solving set partitioning problems
• Constraint Aggregation in Column Generation Models for Resource-Constrained Covering Problems

Cites work

• A Column Generation Approach for Large-Scale Aircrew Rostering Problems
• A Column Generation Approach to the Urban Transit Crew Scheduling Problem
• A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
• A Linear Programming Approach to the Cutting-Stock Problem
• A Request Clustering Algorithm for Door-to-Door Handicapped Transportation
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• Branch-and-price: Column generation for solving huge integer programs
• Column Generation
• Decomposition Principle for Linear Programs
• Dynamic Aggregation of Set-Partitioning Constraints in Column Generation
• scientific article; zbMATH DE number 1452994 (Why is no real title available?)
• scientific article; zbMATH DE number 956787 (Why is no real title available?)
• Multi-phase dynamic constraint aggregation for set partitioning type problems
• Routing with time windows by column generation
• Shortest Path Problems with Resource Constraints
• Simultaneous Vehicle and Crew Scheduling in Urban Mass Transit Systems
• Solving binary cutting stock problems by column generation and branch- and-bound
• The pickup and delivery problem with time windows

Cited in

(12)

• Dynamic constraint aggregation for solving very large-scale airline crew pairing problems
• Stabilized dynamic constraint aggregation for solving set partitioning problems
• A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports
• Row-reduced column generation for degenerate master problems
• A stabilized structured Dantzig-Wolfe decomposition method
• 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
• Vector Space Decomposition for Solving Large-Scale Linear Programs
• Dynamic Aggregation of Set-Partitioning Constraints in Column Generation
• Solving the patient admission scheduling problem using constraint aggregation
• Multi-phase dynamic constraint aggregation for set partitioning type problems
• Column generation decomposition with the degenerate constraints in the subproblem

This page was built for publication: Bi-dynamic constraint aggregation and subproblem reduction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2459403)