Approximation Schemes for Minimum Latency Problems
From MaRDI portal
Publication:4429687
DOI10.1137/S0097539701399654zbMath1047.68166OpenAlexW1991678853MaRDI QIDQ4429687
Publication date: 28 September 2003
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539701399654
vehicle routingapproximation algorithmstraveling repairmanminimum latency tourquasi-polynomial approximation schemesrandomized search ratiosearch ratio
Transportation, logistics and supply chain management (90B06) Paths and cycles (05C38) Approximation algorithms (68W25)
Related Items (10)
Exact algorithms for the minimum latency problem ⋮ Approximation algorithms for the a priori traveling repairman ⋮ The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach ⋮ A simple and effective metaheuristic for the minimum latency problem ⋮ Search and delivery man problems: when are depth-first paths optimal? ⋮ A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing ⋮ The expanding search ratio of a graph ⋮ Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints ⋮ The Chinese deliveryman problem ⋮ Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems
This page was built for publication: Approximation Schemes for Minimum Latency Problems
