New lower bound for the capacitated arc routing problem

DOI10.1016/j.cor.2005.02.015zbMath1094.90043OpenAlexW2076475865MaRDI QIDQ2496046

Sanne Wøhlk

Publication date: 30 June 2006

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2005.02.015

zbMATH Keywords

lower boundscapacitated arc routing problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (10)

GRASP with evolutionary path-relinking for the capacitated arc routing problem ⋮ On matchings, T‐joins, and arc routing in road networks ⋮ Improved lower bounds and exact algorithm for the capacitated arc routing problem ⋮ Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics ⋮ A Decade of Capacitated Arc Routing ⋮ A variable neighborhood search for the capacitated arc routing problem with intermediate facilities ⋮ An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem ⋮ The open capacitated arc routing problem ⋮ Recent results on Arc Routing Problems: An annotated bibliography ⋮ A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands

Cites Work

• Transforming arc routing into node routing problems
• The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases
• New lower bounds for the Capacitated Arc Routing Problem
• Capacitated arc routing problems
• NODE DUPLICATION LOWER BOUNDS FOR THE CAPACITATED ARC ROUTING PROBLEM
• The Capacitated Arc Routing Problem: Lower bounds

This page was built for publication: New lower bound for the capacitated arc routing problem