NODE DUPLICATION LOWER BOUNDS FOR THE CAPACITATED ARC ROUTING PROBLEM

DOI10.15807/JORSJ.35.119MaRDI QIDQ4015406zbMATH OpenOpenAlexFDO

Authors Yasufumi Saruwatari, Ryuichi Hirabayashi, Naonori Nishida

Publication date 11 February 1993

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15807/jorsj.35.119

zbMATH Keywords

branch-and-boundcapacitated arc routingtight lower bounds

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Transportation, logistics and supply chain management (90B06) Programming involving graphs or networks (90C35)

Recommendations

• New lower bound for the capacitated arc routing problem
• The Capacitated Arc Routing Problem: Lower bounds
• New lower bounds for the Capacitated Arc Routing Problem
• The capacitated arc routing problem: combinatorial lower bounds
• Improved lower bounds and exact algorithm for the capacitated arc routing problem

Cited in

(10)

• 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
• New lower bound for the capacitated arc routing problem
• Solving capacitated arc routing problems using a transformation to the CVRP
• A lower bound for the node, edge, and arc routing problem
• A decade of capacitated arc routing
• The capacitated arc routing problem: combinatorial lower bounds
• scientific article; zbMATH DE number 232390 (Why is no real title available?)
• On matchings, T‐joins, and arc routing in road networks

This page was built for publication: NODE DUPLICATION LOWER BOUNDS 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 Q4015406)