Cut-First Branch-and-Price Second for the Capacitated Arc-Routing Problem

DOI10.1007/978-3-319-28697-6_70MaRDI QIDQ2806992zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

full-fledged branch-and-price algorithmpricing problem relaxations

Mathematics Subject Classification ID

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

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

Cites work

• A cutting plane algorithm for the capacitated arc routing problem
• Capacitated arc routing problems
• Cut-first branch-and-price-second for the capacitated arc-routing problem
• Exploiting sparsity in pricing routines for the capacitated arc routing problem
• New route relaxation and pricing strategies for the vehicle routing problem
• The Capacitated Arc Routing Problem: Lower bounds
• The capacitated arc routing problem: Valid inequalities and facets
• The shortest-path problem with resource constraints and \(k\)-cycle elimination for \(k\geq 3\)

Cited in

(6)

• Cut-first branch-and-price-second for the capacitated arc-routing problem
• A branch-and-price algorithm for capacitated arc routing problem with flexible time windows
• A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands
• Exploiting sparsity in pricing routines for the capacitated arc routing problem
• The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem
• A cutting plane algorithm for the capacitated arc routing problem

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)