Cut-First Branch-and-Price Second for the Capacitated Arc-Routing Problem
From MaRDI portal
Publication:2806992
DOI10.1007/978-3-319-28697-6_70zbMath1343.90006MaRDI QIDQ2806992
Claudia Schlebusch, Stefan Irnich
Publication date: 19 May 2016
Published in: Operations Research Proceedings (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-28697-6_70
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90B06: Transportation, logistics and supply chain management
Cites Work
- Exploiting sparsity in pricing routines for the capacitated arc routing problem
- The capacitated arc routing problem: Valid inequalities and facets
- A cutting plane algorithm for the capacitated arc routing problem
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
- The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
- Capacitated arc routing problems
- The Capacitated Arc Routing Problem: Lower bounds
- Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem