Pages that link to "Item:Q2401157"
From MaRDI portal
The following pages link to Compact, provably-good LPs for orienteering and regret-bounded vehicle routing (Q2401157):
Displaying 6 items.
- A constant-factor approximation for directed latency in quasi-polynomial time (Q2119400) (← links)
- Faster algorithms for orienteering and \(k\)-TSP (Q2124233) (← links)
- Combinatorial algorithms for rooted prize-collecting walks and applications to orienteering and minimum-latency problems (Q2164695) (← links)
- A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time (Q5874522) (← links)
- Improving the approximation ratio for capacitated vehicle routing (Q5918417) (← links)
- Improving the approximation ratio for capacitated vehicle routing (Q5925635) (← links)