Exploiting sparsity in pricing routines for the capacitated arc routing problem
type: Item
instance of: scholarly article
title: Exploiting sparsity in pricing routines for the capacitated arc routing problem
zbMATH Open document ID: 1158.90321
author: Adam N. Letchford
author: Amar Oukil
published in: Computers \& Operations Research
publication date: 2009-04-17T00:00:00Z
full work available at URL: 10.pdf
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 5544753
zbMATH Keywords: arc routing
zbMATH Keywords: column generation
zbMATH Keywords: branch-cut-and-price
describes a project that uses: CVRPSP
MaRDI profile type: Publication
Wikidata QID: Q57702228
OpenAlex ID: W1997401436
cites work: Q4510100
cites work: Capacitated arc routing problems
cites work: Q3159349
cites work: Solving capacitated arc routing problems using a transformation to the CVRP
cites work: Robust branch-and-cut-and-price for the capacitated vehicle routing problem
cites work: Transforming arc routing into node routing problems
cites work: Q4762469
cites work: Exact methods based on node-routing formulations for undirected arc-routing problems
cites work: A new branch-and-cut algorithm for the capacitated vehicle routing problem
cites work: Capacitated Vehicle Routing on Trees
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: Q4532226
cites work: Fibonacci heaps and their uses in improved network optimization algorithms
cites work: The shortest-path problem with resource constraints and \(k\)-cycle elimination for \(k\geq 3\)
cites work: A result on projection for the vehicle routing problem
cites work: The Capacitated Arc Routing Problem: Lower bounds
cites work: A deterministic tabu search algorithm for the capacitated arc routing problem
cites work: Stabilized column generation
DOI: 10.1016/J.COR.2008.09.008
description: scientific article; zbMATH DE number 5544753