Cut-First Branch-and-Price Second for the Capacitated Arc-Routing Problem
From MaRDI portal
Publication:2806992
DOI10.1007/978-3-319-28697-6_70zbMATH Open1343.90006OpenAlexW2575431039MaRDI QIDQ2806992FDOQ2806992
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
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)
Cites Work
- Exploiting sparsity in pricing routines for the capacitated arc routing problem
- The shortest-path problem with resource constraints and \(k\)-cycle elimination for \(k\geq 3\)
- New route relaxation and pricing strategies for the vehicle routing problem
- Capacitated arc routing problems
- The Capacitated Arc Routing Problem: Lower bounds
- Cut-First Branch-and-Price-Second 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
Cited In (2)
Recommendations
- Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem 👍 👎
- A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem 👍 👎
- A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem 👍 👎
- Two-phase branch-and-cut for the mixed capacitated general routing problem 👍 👎
- A cutting plane algorithm for the capacitated arc routing problem 👍 👎
- A Branch-and-Cut method for the Capacitated Location-Routing Problem 👍 👎
- A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands 👍 👎
- Improved branch-cut-and-price for capacitated vehicle routing 👍 👎
This page was built for publication: Cut-First Branch-and-Price Second for the Capacitated Arc-Routing Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2806992)
