Skip to main content
Book Chapter

The Generalized Traveling Salesman and Orienteering Problems

  • Fischetti M
  • Salazar-Gonzalez J
  • Toth P
DOI: 10.1007/0-306-48213-4_13
N/ACitations
Citations of this article
20Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Routing and Scheduling problems often require the determination of optimal sequences subject to a given set of constraints. The best known problem of this type is the classical Traveling Salesman Problem (TSP), calling for a minimum cost Hamiltonian cycle on a given graph.

Cite

CITATION STYLE

APA

Fischetti, M., Salazar-Gonzalez, J.-J., & Toth, P. (2007). The Generalized Traveling Salesman and Orienteering Problems (pp. 609–662). https://doi.org/10.1007/0-306-48213-4_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free