An exact algorithm for the capacitated arc routing problem with deadheading demand
From MaRDI portal
Publication:5301129
DOI10.1287/OPRE.1120.1154zbMATH Open1267.90016OpenAlexW2110620774MaRDI QIDQ5301129FDOQ5301129
Authors: Enrico Bartolini, Jean-François Cordeau, G. Laporte 
Publication date: 2 July 2013
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.1120.1154
Recommendations
- Capacitated arc routing problem with deadheading demands
- Improved lower bounds and exact algorithm for the capacitated arc routing problem
- A cutting plane algorithm for the capacitated arc routing problem
- Augment-insert algorithms for the capacitated arc routing problem
- Approximate solutions for the capacitated arc routing problem
Cited In (10)
- Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics
- An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems
- The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem
- An updated annotated bibliography on arc routing problems
- Solving the time capacitated arc routing problem under fuzzy and stochastic travel and service times
- An approach to the asymmetric multi-depot capacitated arc routing problem
- Lane covering with partner bounds in collaborative truckload transportation procurement
- A strategic oscillation simheuristic for the time capacitated arc routing problem with stochastic demands
- Robust drone selective routing in humanitarian transportation network assessment
- Capacitated arc routing problem with deadheading demands
This page was built for publication: An exact algorithm for the capacitated arc routing problem with deadheading demand
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301129)
