Bi-dynamic constraint aggregation and subproblem reduction
Authors:
- Issmail ElhallaouiIEIssmail Elhallaoui
- Guy DesaulniersGDGuy Desaulniers
- Abdelmoutalib MetraneAMAbdelmoutalib Metrane
- François SoumisFSFrançois Soumis
- 1 May 2008
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 35 (5) , 1713-1724
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Dynamic Aggregation of Set-Partitioning Constraints in Column GenerationOperations Research, 2005
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problemsNetworks, 2004
- Simultaneous Vehicle and Crew Scheduling in Urban Mass Transit SystemsTransportation Science, 2001
- A Column Generation Approach for Large-Scale Aircrew Rostering ProblemsOperations Research, 1999
- Branch-and-Price: Column Generation for Solving Huge Integer ProgramsOperations Research, 1998
- A Request Clustering Algorithm for Door-to-Door Handicapped TransportationTransportation Science, 1995
- Solving binary cutting stock problems by column generation and branch-and-boundComputational Optimization and Applications, 1994
- The pickup and delivery problem with time windowsEuropean Journal of Operational Research, 1991
- A Column Generation Approach to the Urban Transit Crew Scheduling ProblemTransportation Science, 1989
- Routing with time windows by column generationNetworks, 1984