Improved lower bounds and exact algorithm for the capacitated arc routing problem
type: Item
instance of: scholarly article
title: Improved lower bounds and exact algorithm for the capacitated arc routing problem
zbMATH Open document ID: 1262.90100
author: Enrico Bartolini
author: Jean-François Cordeau
author: G. Laporte
published in: Mathematical Programming. Series A. Series B
publication date: 2013-03-18T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6145985
zbMATH Keywords: arc routing
zbMATH Keywords: set partitioning
zbMATH Keywords: valid inequalities
zbMATH Keywords: column generation
describes a project that uses: VRP
describes a project that uses: CVRPSEP
describes a project that uses: CPLEX
describes a project that uses: CVRPSP
MaRDI profile type: Publication
full work available at URL: s10107-011-0497-4
OpenAlex ID: W2117319367
cites work: Q5687196
cites work: The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases
cites work: An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
cites work: Exact methods based on node-routing formulations for undirected arc-routing problems
cites work: New route relaxation and pricing strategies for the vehicle routing problem
cites work: The capacitated arc routing problem: Valid inequalities and facets
cites work: A cutting plane algorithm for the capacitated arc routing problem
cites work: The Capacitated Arc Routing Problem: Lower bounds
cites work: A guided local search heuristic for the capacitated arc routing problem
cites work: Exact solution of the generalized routing problem through graph transformations
cites work: Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem
cites work: Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
cites work: Recent results on Arc Routing Problems: An annotated bibliography
cites work: Q4510100
cites work: Routeing winter gritting vehicles
cites work: Arc Routing Problems, Part I: The Chinese Postman Problem
cites work: Arc Routing Problems, Part II: The Rural Postman Problem
cites work: Robust branch-and-cut-and-price for the capacitated vehicle routing problem
cites work: An efficient transformation of the generalized vehicle routing problem
cites work: Capacitated arc routing problems
cites work: NODE DUPLICATION LOWER BOUNDS FOR THE CAPACITATED ARC ROUTING PROBLEM
cites work: Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
cites work: Exploiting sparsity in pricing routines for the capacitated arc routing problem
cites work: Solving capacitated arc routing problems using a transformation to the CVRP
cites work: A new branch-and-cut algorithm for the capacitated vehicle routing problem
cites work: Odd Minimum Cut-Sets and b-Matchings
cites work: New lower bounds for the Capacitated Arc Routing Problem
cites work: Q3801316
cites work: New lower bound for the capacitated arc routing problem
cites work: A Decade of Capacitated Arc Routing
DOI: 10.1007/S10107-011-0497-4
description: scientific article; zbMATH DE number 6145985