Sales‐delivery man problems on treelike networks
From MaRDI portal
Publication:4698228
DOI10.1002/net.3230250204zbMath0833.90036MaRDI 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
trees; polynomial algorithms; delivery man problem; NP- complete; cactus networks; multiserver variants
90C35: Programming involving graphs or networks
90C60: Abstract computational complexity for mathematical programming problems
90B06: Transportation, logistics and supply chain management
Related Items
A note on the traveling repairman problem, 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times., A faster 2-approximation algorithm for the minmax \(p\)-traveling salesmen problem on a tree, An approximability result of the multi-vehicle scheduling problem on a path with release and handling times, Minmax subtree cover problem on cacti, Approximation algorithms for distance constrained vehicle routing problems, Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks
Cites Work