An Approximation Algorithm for the Capacitated Arc Routing Problem
From MaRDI portal
Publication:3192847
DOI10.2174/1874243200802010008zbMath1322.90015OpenAlexW2138962696MaRDI QIDQ3192847
Publication date: 14 October 2015
Published in: The Open Operational Research Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2174/1874243200802010008
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Deterministic network models in operations research (90B10)
Related Items (11)
GRASP with evolutionary path-relinking for the capacitated arc routing problem ⋮ Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs ⋮ On approximate data reduction for the Rural Postman Problem: Theory and experiments ⋮ Set covering in fuel-considered vehicle routing problems ⋮ The single robot line coverage problem: Theory, algorithms, and experiments ⋮ Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems ⋮ Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics ⋮ A lower bound for the adaptive two-echelon capacitated vehicle routing problem ⋮ The open capacitated arc routing problem ⋮ Recent results on Arc Routing Problems: An annotated bibliography ⋮ Constant-factor approximations for capacitated arc routing without triangle inequality
This page was built for publication: An Approximation Algorithm for the Capacitated Arc Routing Problem
