The capacitated arc routing problem with refill points
type: Item
instance of: scholarly article
title: The capacitated arc routing problem with refill points
zbMATH Open document ID: 1278.90413
author: Alberto Amaya
author: Martin Trépanier
author: André Langevin
published in: Operations Research Letters
publication date: 2007-08-27T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 5183127
zbMATH Keywords: multi-trip rural postman problem
zbMATH Keywords: capacitated arc routing problem
zbMATH Keywords: replenishment points
zbMATH Keywords: integer linear model
zbMATH Keywords: road marking
MaRDI profile type: Publication
full work available at URL: j.orl.2005.12.009
OpenAlex ID: W2030322691
cites work: The capacitated arc routing problem: Valid inequalities and facets
cites work: The Capacitated Arc Routing Problem: Lower bounds
cites work: Q4510100
cites work: Q4762467
cites work: The capacitated arc routing problem with intermediate facilities
cites work: Eulerian location problems
cites work: A branch-and-cut algorithm for the undirected rural postman problem
cites work: Capacitated arc routing problems
cites work: A Tabu Search Heuristic for the Capacitated arc Routing Problem
cites work: Q4367082
DOI: 10.1016/J.ORL.2005.12.009
description: scientific article