An approach to the asymmetric multi-depot capacitated arc routing problem

DOI10.1016/j.ejor.2015.01.005zbMath1346.90144OpenAlexW2066210488MaRDI QIDQ319291

Tom Van Woensel, Dmitry Krushinsky

Publication date: 6 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://research.tue.nl/nl/publications/2cf117bf-a2df-41ee-ad88-6f674ab4fd5f

zbMATH Keywords

valid inequalitiesbranch-and-cutarc routing

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)

Related Items

A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints, Multi-depot rural postman problems, A branch‐and‐cut algorithm for a bipartite graph construction problem in digital communication systems, Arc routing problems: A review of the past, present, and future

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem
• The generalized assignment problem: Valid inequalities and facets
• A cutting plane algorithm for the capacitated arc routing problem
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• New results on the windy postman problem
• Solving capacitated arc routing problems using a transformation to the CVRP
• Recent results on Arc Routing Problems: An annotated bibliography
• Capacitated arc routing problems
• Facets of the knapsack polytope
• A new approach to the minimum cut problem
• A Minimal Algorithm for the 0-1 Knapsack Problem
• Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem
• An Exact Algorithm for the Capacitated Arc Routing Problem with Deadheading Demand