Exact algorithms for the minimum latency problem
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 2079325 (Why is no real title available?)
- scientific article; zbMATH DE number 2086925 (Why is no real title available?)
- scientific article; zbMATH DE number 2102754 (Why is no real title available?)
- A note on the traveling repairman problem
- An improved approximation ratio for the minimum latency problem
- Approximation Schemes for Minimum Latency Problems
- Polynomial time algorithms for some minimum latency problems
- TSPLIB—A Traveling Salesman Problem Library
- The complexity of the travelling repairman problem
- The delivery man problem on a tree network
- The minimum latency problem
Cited in
(12)- A new formulation for the traveling deliveryman problem
- Profit-based latency problems on the line
- 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
- An effective memetic algorithm for the cumulative capacitated vehicle routing problem
- Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
- Variable neighborhood search for the travelling deliveryman problem
- The delivery man problem with time windows
- An efficient two-phase metaheuristic algorithm for the time dependent traveling salesman problem
- A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
- Heuristics for the traveling repairman problem with profits
- Solving the traveling repairman problem with profits: a novel variable neighborhood search approach
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)
