Polynomial time algorithms for some minimum latency problems

DOI10.1016/S0020-0190(00)00102-2zbMath1339.68125MaRDI QIDQ294831

Bang Ye Wu

Publication date: 16 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019000001022?np=y

zbMATH Keywords

dynamic programmingminimum latency problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

Exact algorithms for the minimum latency problem ⋮ Approximation algorithms for the a priori traveling repairman ⋮ Minimizing total weighted latency in home healthcare routing and scheduling with patient prioritization ⋮ Hybrid evolutionary search for the traveling repairman problem with profits ⋮ Profit-based latency problems on the line ⋮ Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem

Cites Work

• Unnamed Item
• Unnamed Item
• The delivery man problem on a tree network
• The minimum latency problem
• Approximation schemes for minimum latency problems
• A Dynamic Programming Approach to Sequencing Problems
• The complexity of the travelling repairman problem

This page was built for publication: Polynomial time algorithms for some minimum latency problems