New lower bound for the capacitated arc routing problem

DOI10.1016/J.COR.2005.02.015MaRDI QIDQ2496046zbMATH OpenOpenAlexFDO

Authors 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

capacitated arc routing problemlower bounds

Mathematics Subject Classification ID

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

Recommendations

• NODE DUPLICATION LOWER BOUNDS FOR THE CAPACITATED ARC ROUTING PROBLEM
• The capacitated arc routing problem: combinatorial lower bounds
• The Capacitated Arc Routing Problem: Lower bounds
• New lower bounds for the Capacitated Arc Routing Problem
• Improved lower bounds and exact algorithm for the capacitated arc routing problem

Cites work

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

Cited in

(16)

• A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands
• Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics
• An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem
• Improved lower bounds and exact algorithm for the capacitated arc routing problem
• Recent results on arc routing problems: an annotated bibliography
• Improved bounds for large scale capacitated arc routing problem
• GRASP with evolutionary path-relinking for the capacitated arc routing problem
• A decade of capacitated arc routing
• New lower bounds for the Capacitated Arc Routing Problem
• NODE DUPLICATION LOWER BOUNDS FOR THE CAPACITATED ARC ROUTING PROBLEM
• The Capacitated Arc Routing Problem: Lower bounds
• The capacitated arc routing problem: combinatorial lower bounds
• New upper bounds for the multi-depot capacitated arc routing problem
• On matchings, T‐joins, and arc routing in road networks
• The open capacitated arc routing problem
• A variable neighborhood search for the capacitated arc routing problem with intermediate facilities

This page was built for publication: New lower bound 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 Q2496046)