The delivery man problem on a tree network
From MaRDI portal
Publication:920033
DOI10.1007/BF02097807zbMath0707.90094MaRDI QIDQ920033
Publication date: 1989
Published in: Annals of Operations Research (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Trees (05C05) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (14)
A constant-factor approximation for directed latency in quasi-polynomial time ⋮ A note on the traveling repairman problem ⋮ Exact algorithms for the minimum latency problem ⋮ Polynomial time algorithms for some minimum latency problems ⋮ The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach ⋮ Search and delivery man problems: when are depth-first paths optimal? ⋮ The Directed Minimum Latency Problem ⋮ Approximating the \(k\)-traveling repairman problem with repair times ⋮ A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time ⋮ Profit-based latency problems on the line ⋮ Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints ⋮ The Chinese deliveryman problem ⋮ An improved approximation ratio for the minimum latency problem ⋮ Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks
Cites Work
This page was built for publication: The delivery man problem on a tree network
