scientific article; zbMATH DE number 6741965
From MaRDI portal
Publication:5271455
zbMath1387.90254MaRDI QIDQ5271455
Publication date: 11 July 2017
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
capacitated arc routing problemd-pathnode duplicationcombinatorial lower boundnode paritynode scanningrequired edges
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (3)
On matchings, T‐joins, and arc routing in road networks ⋮ Fast upper and lower bounds for a large‐scale real‐world arc routing problem ⋮ Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics
This page was built for publication: