Exact algorithms for the minimum latency problem
From MaRDI portal
Publication:834971
DOI10.1016/J.IPL.2004.09.009zbMATH Open1173.68832OpenAlexW2005117954MaRDI QIDQ834971FDOQ834971
Authors: Bang Ye Wu, Zheng-Nan Huang, Fu-Jie Zhan 
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
Cites Work
- TSPLIB—A Traveling Salesman Problem Library
- An improved approximation ratio for the minimum latency problem
- The minimum latency problem
- Polynomial time algorithms for some minimum latency problems
- The complexity of the travelling repairman problem
- Approximation Schemes for Minimum Latency Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- The delivery man problem on a tree network
- A note on the traveling repairman problem
- Title not available (Why is that?)
Cited In (12)
- An efficient two-phase metaheuristic algorithm for the time dependent traveling salesman problem
- A new formulation for the traveling deliveryman problem
- Heuristics for the traveling repairman problem with profits
- Solving the traveling repairman problem with profits: a novel variable neighborhood search approach
- Profit-based latency problems on the line
- The delivery man problem with time windows
- 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 simple and effective metaheuristic for the minimum latency problem
- The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach
- Variable neighborhood search for the travelling deliveryman problem
This page was built for publication: Exact algorithms for the minimum latency problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q834971)
