• DOI:10.1007/978-3-319-59250-3_17
Corpus ID: 22571869

Compact, Provably-Good LPs for Orienteering and Regret-Bounded Vehicle Routing

@article{Friggstad2017CompactPL,
  title={Compact, Provably-Good LPs for Orienteering and Regret-Bounded Vehicle Routing},
  author={Zachary Friggstad and C. Swamy},
  journal={ArXiv},
  year={2017},
  volume={abs/1708.01335}
}

Zachary Friggstad, C. Swamy

Published 2017

Mathematics, Computer Science

ArXiv

We develop polynomial-size LP-relaxations for orienteering and the regret-bounded vehicle routing problem (\(\mathsf {RVRP}\)) and devise suitable LP-rounding algorithms that lead to various new insights and approximation results for these problems. In orienteering, the goal is to find a maximum-reward r-rooted path, possibly ending at a specified node, of length at most some given budget B. In \(\mathsf {RVRP}\), the goal is to find the minimum number of r-rooted paths of regret at most a… CONTINUE READING

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed