Skip to main content
SpringerLink
Log in

Orienteering Problems

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

  • 104 Accesses

Years and Authors of Summarized Original Work

  • 2004; Bansal, Blum, Chawla, Meyerson

  • 2007; Blum, Chawla, Karger, Lane, Meyerson, Minkoff

  • 2011; Nagarajan, Ravi

  • 2012; Chekuri, Korula, Pál

Problem Definition

The Orienteering problem and its variants are in the large class of vehicle routing problems, also containing the traveling salesperson problem (TSP), in which the goal is to find a short route that visits several potential destinations. Typically, the input is represented by a graph G(V, E) with an associated length function ℓ: E → R+, where each destination is a vertex v ∈ V , and an edge e = (u, v) has length ℓ(e) representing the distance between u and v or the time it takes to travel between them. Unlike TSP, where the goal is to find a short tour visiting all vertices, Orienteering and its variants typically involve finding short walks that visit many vertices; having to choose the set of vertices to visit adds additional complexity to the problem.

In Orienteering, we are given a...

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Arkin E, Mitchell J, Narasimhan G (1998) Resource-constrained geometric network optimization. In: Symposium on computational geometry, Minneapolis, pp 307–316

    Google Scholar 

  2. Bansal N, Blum A, Chawla S, Meyerson A (2004) Approximation algorithms for deadline-TSP and vehicle routing with time-windows. In: Proceedings of the 36th annual ACM symposium on theory of computing, Chicago. ACM, New York, pp 166–174

    Google Scholar 

  3. Blum A, Chawla S, Karger D, Lane T, Meyerson A, Minkoff M (2007) Approximation algorithms for orienteering and discounted-reward TSP. SIAM J Comput 37(2):653–670

    Article  MathSciNet  MATH  Google Scholar 

  4. Chaudhuri K, Godfrey B, Rao S, Talwar K (2003) Paths, trees, and minimum latency tours. In: 44th annual symposium on foundations of computer science, Cambridge. IEEE Computer Society, pp 36–45

    Google Scholar 

  5. Chekuri C, Pál M (2005) A recursive greedy algorithm for walks in directed graphs. In: Proceedings of the 46th annual symposium on foundations of computer science, Pittsburgh. IEEE Computer Society, pp 245–253

    Google Scholar 

  6. Chekuri C, Korula N, Pál M (2012) Improved algorithms for orienteering and related problems. ACM Trans Algorithms (TALG) 8(3):23

    MathSciNet  MATH  Google Scholar 

  7. Chen K, Har-Peled S (2008) The orienteering problem in the plane revisited. SIAM J Comput 38(1):385–397, preliminary version in Proceedings of the ACM SoCG, Sedona, 2006, pp 247–254

    Google Scholar 

  8. Nagarajan V, Ravi R (2011) The directed orienteering problem. Algorithmica 60(4):1017–1030

    Article  MathSciNet  MATH  Google Scholar 

  9. Toth P, Vigo D (eds) (2001) The vehicle routing problem. SIAM monographs on discrete mathematics and applications. Society for Industrial and Applied Mathematics, Philadelphia

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Google Research, New York, NY, USA

    Nitish Korula

Authors
  1. Nitish Korula
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nitish Korula .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Korula, N. (2016). Orienteering Problems. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_540

Download citation

Publish with us

Policies and ethics

Search

Navigation