Exact algorithms for the minimum latency problem

DOI10.1016/j.ipl.2004.09.009zbMath1173.68832OpenAlexW2005117954MaRDI QIDQ834971

Fu-Jie Zhan, Zheng-Nan Huang, Bang Ye Wu

Publication date: 27 August 2009

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

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.09.009

zbMATH Keywords

algorithmsdynamic programmingbranch and boundminimum latency problem

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Dynamic programming (90C39)

Related Items

Heuristics for the traveling repairman problem with profits ⋮ 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 ⋮ Variable neighborhood search for the travelling deliveryman problem ⋮ The delivery man problem with time windows ⋮ Profit-based latency problems on the line ⋮ Solving the traveling repairman problem with profits: a novel variable neighborhood search approach ⋮ Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem ⋮ An effective memetic algorithm for the cumulative capacitated vehicle routing problem ⋮ A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem ⋮ A new formulation for the traveling deliveryman problem ⋮ An efficient two-phase metaheuristic algorithm for the time dependent traveling Salesman problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polynomial time algorithms for some minimum latency problems
• The delivery man problem on a tree network
• An improved approximation ratio for the minimum latency problem
• The minimum latency problem
• The complexity of the travelling repairman problem
• TSPLIB—A Traveling Salesman Problem Library
• Approximation Schemes for Minimum Latency Problems
• A note on the traveling repairman problem