Lower and upper bounds for the mixed capacitated arc routing problem
type: Item
instance of: scholarly article
title: Lower and upper bounds for the mixed capacitated arc routing problem
zbMATH Open document ID: 1094.90035
author: Enrique Benavent
author: Philippe Lacomme
author: Christian Prins
author: José-Manuel Belenguer
published in: Computers \& Operations Research
publication date: 2006-06-30T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5037985
zbMATH Keywords: capacitated arc routing problem
zbMATH Keywords: mixed graph
zbMATH Keywords: lower bound
zbMATH Keywords: cutting plane
zbMATH Keywords: heuristic
zbMATH Keywords: memetic algorithm
zbMATH Keywords: waste collection
MaRDI profile type: Publication
full work available at URL: j.cor.2005.02.009
OpenAlex ID: W2078408696
cites work: Capacitated arc routing problems
cites work: Q5687196
cites work: Q5287166
cites work: The fleet size and mix problem for capacitated arc routing
cites work: Q4350080
cites work: A Tabu Search Heuristic for the Capacitated arc Routing Problem
cites work: Q2770548
cites work: Competitive memetic algorithms for arc routing problems
cites work: A guided local search heuristic for the capacitated arc routing problem
cites work: A cutting plane algorithm for the capacitated arc routing problem
cites work: An optimal algorithm for the mixed Chinese postman problem
cites work: The mixed general routing polyhedron
cites work: Q5514188
cites work: Q4762468
cites work: Odd Minimum Cut-Sets and b-Matchings
cites work: The Directed Rural Postman Problem with Turn Penalties
cites work: Introduction to algorithms
cites work: The Capacitated Arc Routing Problem: Lower bounds
DOI: 10.1016/J.COR.2005.02.009
description: scientific article