Depth-First Solutions for the Deliveryman Problem on Tree-Like Networks: An Evaluation Using a Permutation Model

DOI10.1287/trsc.30.2.134zbMath0865.90131OpenAlexW2098717403MaRDI QIDQ5689803

Ian R. Webb

Publication date: 7 January 1997

Published in: Transportation Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/trsc.30.2.134

zbMATH Keywords

Lagrangian relaxationsubgradient optimizationdeliveryman problemtraveling repairman problemdepth-first routesforest precedence constraintssingle-machine minimum weighted-completion time problemtree or cactus network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)

This page was built for publication: Depth-First Solutions for the Deliveryman Problem on Tree-Like Networks: An Evaluation Using a Permutation Model