Compact, provably-good LPs for orienteering and regret-bounded vehicle routing

DOI10.1007/978-3-319-59250-3_17zbMath1418.90224arXiv1708.01335OpenAlexW2617377437MaRDI QIDQ2401157

Zachary Friggstad, Chaitanya Swamy

Publication date: 31 August 2017

Full work available at URL: https://arxiv.org/abs/1708.01335

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Related Items (6)

A constant-factor approximation for directed latency in quasi-polynomial time ⋮ Faster algorithms for orienteering and \(k\)-TSP ⋮ Combinatorial algorithms for rooted prize-collecting walks and applications to orienteering and minimum-latency problems ⋮ A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time ⋮ Improving the approximation ratio for capacitated vehicle routing ⋮ Improving the approximation ratio for capacitated vehicle routing

This page was built for publication: Compact, provably-good LPs for orienteering and regret-bounded vehicle routing