An approximation algorithm for the capacitated arc routing problem

DOI10.2174/1874243200802010008MaRDI QIDQ3192847zbMATH OpenOpenAlexFDO

Authors Sanne Wøhlk

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• The capacitated arc routing problem. A heuristic algorithm
• Approximate solutions for the capacitated arc routing problem
• Constant-factor approximations for capacitated arc routing without triangle inequality
• Augment-insert algorithms for the capacitated arc routing problem
• Improved lower bounds and exact algorithm for the capacitated arc routing problem

Cited in

(30)

• A guided local search procedure for the multi-compartment capacitated arc routing problem
• Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics
• The capacitated arc routing problem. A heuristic algorithm
• The rescheduling arc routing problem
• The min-max close-enough arc routing problem
• A lower bound for the adaptive two-echelon capacitated vehicle routing problem
• Divide-and-conquer large scale capacitated arc routing problems with route cutting off decomposition
• A parameterized approximation algorithm for the mixed and windy Capacitated Arc Routing Problem: theory and experiments
• scientific article; zbMATH DE number 1568938 (Why is no real title available?)
• New lower bounds for the Capacitated Arc Routing Problem
• A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
• scientific article; zbMATH DE number 2156293 (Why is no real title available?)
• The single robot line coverage problem: Theory, algorithms, and experiments
• The mixed capacitated arc routing problem with non-overlapping routes
• 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
• Improved bounds for large scale capacitated arc routing problem
• GRASP with evolutionary path-relinking for the capacitated arc routing problem
• Constant-factor approximations for capacitated arc routing without triangle inequality
• The open capacitated arc routing problem
• Set covering in fuel-considered vehicle routing problems
• Approximate solutions for the capacitated arc routing problem
• Recent results on arc routing problems: an annotated bibliography
• A deterministic tabu search algorithm for the capacitated arc routing problem
• A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
• The capacitated arc routing problem: Valid inequalities and facets
• Effects of update frequencies in a dynamic capacitated arc routing problem
• A parallel insert method for the capacitated arc routing problem
• Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems
• Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees

This page was built for publication: An approximation algorithm for the capacitated arc routing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3192847)