Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem
From MaRDI portal
Publication:743645
DOI10.1007/s13675-013-0012-1zbMath1305.90351OpenAlexW2035888716MaRDI QIDQ743645
Odile Marcotte, Mounira Groiez, Ahmed Hadjar, Guy Desaulniers
Publication date: 30 September 2014
Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13675-013-0012-1
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)
Related Items
Crew Assignment with Duty Time Limits for Transport Services: Tight Multicommodity Models ⋮ Valid Inequalities and Separation Algorithms for the Set Partitioning Problem ⋮ Modeling and solving the multimodal car- and ride-sharing problem
Uses Software
Cites Work
- A comparison of five heuristics for the multiple depot vehicle scheduling problem
- Stabilized column generation for highly degenerate multiple-depot vehicle scheduling problems
- A time-space network based exact optimization model for multi-depot bus scheduling
- Solving large multiple-depot multiple-vehicle-type bus scheduling problems in practice
- Vehicle Scheduling in Public Transit and Lagrangean Pricing
- Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling
- A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems
- A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem
- On some matching problems arising in vehicle scheduling models
- A branch and bound algorithm for the multiple depot vehicle scheduling problem
- Odd Minimum Cut-Sets and b-Matchings
- A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
- A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem
- Benchmarking optimization software with performance profiles.
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem