Sales‐delivery man problems on treelike networks
From MaRDI portal
Publication:4698228
DOI10.1002/net.3230250204zbMath0833.90036OpenAlexW1982148583MaRDI QIDQ4698228
Publication date: 18 March 1996
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230250204
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06)
Related Items (7)
A note on the traveling repairman problem ⋮ Approximation algorithms for distance constrained vehicle routing problems ⋮ An approximability result of the multi-vehicle scheduling problem on a path with release and handling times ⋮ 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times. ⋮ Minmax subtree cover problem on cacti ⋮ A faster 2-approximation algorithm for the minmax \(p\)-traveling salesmen problem on a tree ⋮ Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks
Cites Work
This page was built for publication: Sales‐delivery man problems on treelike networks