Pages that link to "Item:Q4429687"
From MaRDI portal
The following pages link to Approximation Schemes for Minimum Latency Problems (Q4429687):
Displayed 10 items.
- A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing (Q494936) (← links)
- Exact algorithms for the minimum latency problem (Q834971) (← links)
- The expanding search ratio of a graph (Q1741496) (← links)
- The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach (Q1926737) (← links)
- A simple and effective metaheuristic for the minimum latency problem (Q1926884) (← links)
- The Chinese deliveryman problem (Q2025136) (← links)
- Search and delivery man problems: when are depth-first paths optimal? (Q2184055) (← links)
- Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints (Q2256169) (← links)
- Approximation algorithms for the a priori traveling repairman (Q2661528) (← links)
- Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems (Q5860477) (← links)