Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem
DOI10.1007/S13675-013-0012-1zbMATH Open1305.90351OpenAlexW2035888716MaRDI QIDQ743645FDOQ743645
Authors: Mounira Groiez, Guy Desaulniers, Ahmed Hadjar, Odile Marcotte 
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
Recommendations
- A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem
- scientific article; zbMATH DE number 1361558
- A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem
- A branch and bound algorithm for the multiple depot vehicle scheduling problem
- Simple and efficient heuristic approach for the multiple-depot vehicle scheduling problem
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)
Cites Work
- Benchmarking optimization software with performance profiles.
- Title not available (Why is that?)
- Title not available (Why is that?)
- A branch and bound algorithm for the multiple depot vehicle scheduling problem
- Odd Minimum Cut-Sets and b-Matchings
- A Column Generation Approach to 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
- A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem
- On some matching problems arising in vehicle scheduling models
- A comparison of five heuristics for the multiple depot vehicle scheduling problem
- A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
- Title not available (Why is that?)
- Path-reduced costs for eliminating arcs in routing and scheduling
- A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems
Cited In (4)
- A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem
- Valid Inequalities and Separation Algorithms for the Set Partitioning Problem
- Modeling and solving the multimodal car- and ride-sharing problem
- Crew Assignment with Duty Time Limits for Transport Services: Tight Multicommodity Models
Uses Software
This page was built for publication: Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q743645)
