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
    5 Citations
    A Framework for Vehicle Routing Approximation Schemes in Trees
    • 2
    • PDF
    Improving the Approximation Ratio for Capacitated Vehicle Routing
    • Highly Influenced
    • PDF
    UAV Trajectory Optimization for Time Constrained Applications
    • 1
    • PDF

    References

    SHOWING 1-10 OF 26 REFERENCES
    Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing
    • 21
    • PDF
    Approximation Algorithms for Orienteering and Discounted-Reward TSP
    • 58
    • PDF
    An Improved Integrality Gap for Asymmetric TSP Paths
    • 4
    Linear Programming-based Approximation Algorithms for Multi-Vehicle Minimum Latency Problems (Extended Abstract)
    • 4
    • PDF
    Approximation algorithms for orienteering and discounted-reward TSP
    • 217
    • PDF
    The k-traveling repairmen problem
    • 56
    The finite capacity dial-a-ride problem
    • M. Charikar, B. Raghavachari
    • Computer Science, Mathematics
    • Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)
    • 1998
    • 62
    Effective-Resistance-Reducing Flows, Spectrally Thin Trees, and Asymmetric TSP
    • Nima Anari, S. O. Gharan
    • Mathematics, Computer Science
    • 2015 IEEE 56th Annual Symposium on Foundations of Computer Science
    • 2015
    • 44
    • PDF
    Improved algorithms for orienteering and related problems
    • 167
    • Highly Influential
    • PDF
    Bounds and Heuristics for Capacitated Routing Problems
    • 313