Skip to main content
SpringerLink
Log in

Il problema del commesso viaggiatore

  • Chapter
Ottimizzazione Combinatoria

Part of the book series: UNITEXT ((UNITEXTMAT))

  • 528 Accesses

Riassunto

Nel Capitolo 15 abbiamo introdotto il problema del commesso viaggiatore, ovvero il Traveling Salesman Problem (TSP) e abbiamo mostrato che è NP-difficile (Teorema 15.43). Il TSP è forse il problema di ottimizzazione combinatoria NP- difficile che è stato studiato meglio, e a cui sono state applicate il maggior numero di tecniche di ottimizzazione. Iniziamo con la presentazione degli algoritmi appros- simati nelle Sezioni 21.1 e 21.2. In pratica, gli algoritmi cosiddetti di ricerca locale (discussi nella Sezione 21.3) trovano delle soluzioni molto buone per istanze di grandi dimensioni anche se non hanno un rapporto di prestazione finito.

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 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.95
Price excludes VAT (USA)
  • Compact, lightweight 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Riferimenti bibliografici

Letteratura generale

  • Applegate, D.L., Bixby, R., Chvatal, V., Cook, W.J. [2007]: The Traveling Salesman Problem: A Computational Study. Princeton University Press

    Google Scholar 

  • Cook, W.J., Cunningham, W.H., Pulleyblank, W.R., Schrijver, A. [1998]: Combinatorial Optimization. Wiley, New York, Chapter 7

    MATH  Google Scholar 

  • Gutin, G., Punnen, A.P. [2002]: The Traveling Salesman Problem and Its Variations. Kluwer, Dordrecht

    MATH  Google Scholar 

  • Jungnickel, D. [2007]: Graphs, Networks and Algorithms. Third Edition. Springer, Berlin, Chapter 15

    Google Scholar 

  • Lawler, E.L., Lenstra J.K., Rinnooy Kan, A.H.G., Shmoys, D.B. [1985]: The Traveling Salesman Problem. Wiley, Chichester

    MATH  Google Scholar 

  • Junger, M., Reinelt, G., Rinaldi, G. [1995]: The traveling salesman problem. In: Handbooks in Operations Research and Management Science; Volume 7; Network Models (M.O. Ball, T.L. Magnanti, C.L. Monma, G.L. Nemhauser, eds.), Elsevier, Amsterdam

    Google Scholar 

  • Papadimitriou, C.H., Steiglitz, K. [1982]: Combinatorial Optimization; Algorithms and Complexity. Prentice-Hall, Englewood Cliffs, Sezione 17.2, Chapters 18 and 19

    MATH  Google Scholar 

  • Reinelt, G. [1994]: The Traveling Salesman; Computational Solutions for TSP Applications. Springer, Berlin

    Google Scholar 

Riferimenti citati

  • Aarts, E., Lenstra, J.K. [1997]: Local Search in Combinatorial Optimization. Wiley, Chichester

    MATH  Google Scholar 

  • Applegate, D., Bixby, R., Chvatal, V., Cook, W. [2003]: Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems. Mathematical Programming B 97, 91–153

    MathSciNet  MATH  Google Scholar 

  • Applegate, D., Cook, W., Rohe, A. [2003]: Chained Lin-Kernighan for large traveling salesman problems. INFORMS Journal on Computing 15, 82–92

    Article  MathSciNet  MATH  Google Scholar 

  • Arora, S. [1998]: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. Journal of the ACM 45, 753–782

    Article  MathSciNet  MATH  Google Scholar 

  • Berman, P., Karpinski, M. [2006]: 8/7-approximation algorithm for (1,2)-TSP. Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, 641–648

    Google Scholar 

  • Boyd, S.C., Cunningham, W.H. [1991]: Small traveling salesman polytopes. Mathematics of Operations Research 16, 259–271

    Article  MathSciNet  MATH  Google Scholar 

  • Burkard, R.E., Deineko, V.G., and Woeginger, G.J. [1998]: The travelling salesman and the PQ-tree. Mathematics of Operations Research 23, 613–623

    Article  MathSciNet  Google Scholar 

  • Carr, R. [1997]: Separating clique trees and bipartition inequalities having a fixed number of handles and teeth in polynomial time. Mathematics of Operations Research 22, 257–265

    Article  MathSciNet  MATH  Google Scholar 

  • Chalasani, P., Motwani, R., Rao, A. [1996]: Algorithms for robot grasp and delivery. Proceedings of the 2nd International Workshop on Algorithmic Foundations of Robotics, 347–362

    Google Scholar 

  • Chandra, B., Karloff, H., Tovey, C. [1999]: New results on the old k-opt algorithm for the traveling salesman problem. SIAM Journal on Computing 28, 1998–2029

    Article  MathSciNet  MATH  Google Scholar 

  • Christofides, N. [1976]: Worst-case analysis of a new heuristic for the traveling salesman problem. Technical Report 388, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh

    Google Scholar 

  • Chvatal, V. [1973]: Edmonds’ polytopes and weakly hamiltonian graphs. Mathematical Programming 5, 29–40

    Article  MathSciNet  MATH  Google Scholar 

  • Crowder, H., Padberg, M.W. [1980]: Solving large-scale symmetric travelling salesman problems to optimality. Management Science 26, 495–509

    Article  MathSciNet  MATH  Google Scholar 

  • Dantzig, G., Fulkerson, R., Johnson, S. [1954]: Solution of a large-scale traveling-salesman problem. Operations Research 2, 393–410

    Article  MathSciNet  Google Scholar 

  • Englert, M., Röglin, H., Vöcking, B. [2007]: Worst case and probabilistic analysis of the 2-opt algorithm for the TSP. Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, 1295–1304

    Google Scholar 

  • Feige, U., Singh, M. [2007]: Improved approximation algorithms for traveling salesperson tours and paths in directed graphs. Proceedings of the 10th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems; LNCS 4627 (M. Charikar, K. Jansen, O. Reingold, J.D.P. Rolim, eds.), Springer, Berlin, pp. 104–118

    Google Scholar 

  • Frank, A., Triesch, E., Korte, B., Vygen, J. [1998]: On the bipartite travelling salesman problem. Report No. 98866, Research Institute for Discrete Mathematics, University of Bonn

    Google Scholar 

  • Frieze, A., Galbiati, G., Maffioli, F. [1982]: On the worst-case performance of some algorithms for the asymmetric traveling salesman problem. Networks 12, 23–39

    Article  MathSciNet  MATH  Google Scholar 

  • Garey, M.R., Graham, R.L., Johnson, D.S. [1976]: Some NP-complete geometric problems. Proceedings of the 8th Annual ACM Symposium on the Theory of Computing, 10–22

    Google Scholar 

  • Grötschel, M., Padberg, M.W. [1979]: On the symmetric travelling salesman problem. Mathematical Programming 16, 265–302

    Article  MathSciNet  MATH  Google Scholar 

  • Grötschel, M., Pulleyblank, W.R. [1986]: Clique tree inequalities and the symmetric travelling salesman problem. Mathematics of Operations Research 11, 537–569

    Article  MathSciNet  MATH  Google Scholar 

  • Held, M., Karp, R.M. [1962]: A dynamic programming approach to sequencing problems. Journal of SIAM 10, 196–210

    MathSciNet  MATH  Google Scholar 

  • Held M., Karp, R.M. [1970]: The traveling-salesman problem and minimum spanning trees. Operations Research 18, 1138–1162

    Article  MathSciNet  MATH  Google Scholar 

  • Held, M., Karp, R.M. [1971]: The traveling-salesman problem and minimum spanning trees; part II. Mathematical Programming 1, 6–25

    Article  MathSciNet  MATH  Google Scholar 

  • Hurkens, C.A.J., Woeginger, G.J. [2004]: On the nearest neighbour rule for the traveling salesman problem. Operations Research Letters 32, 1–4

    Article  MathSciNet  MATH  Google Scholar 

  • Hwang, R.Z., Chang, R.C., Lee, R.C.T. [1993]: The searching over separators strategy to solve some NP-hard problems in subexponential time. Algorithmica 9, 398–423

    Article  MathSciNet  MATH  Google Scholar 

  • Johnson, D.S., McGeoch, L.A., Rothberg, E.E. [1996]: Asymptotic experimental analysis for the Held-Karp traveling salesman bound. Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, 341–350

    Google Scholar 

  • Johnson, D.S., Papadimitriou, C.H., Yannakakis, M. [1988]: How easy is local search? Journal of Computer and System Sciences 37, 79–100

    Article  MathSciNet  MATH  Google Scholar 

  • Jünger, M., Naddef, D. [2001]: Computational Combinatorial Optimization. Springer, Berlin

    Book  MATH  Google Scholar 

  • Karp, R.M. [1977]: Probabilistic analysis of partitioning algorithms for the TSP in the plane. Mathematics of Operations Research 2, 209–224

    Article  MathSciNet  MATH  Google Scholar 

  • Karp, R.M., Papadimitriou, C.H. [1982]: On linear characterizations of combinatorial optimization problems. SIAM Journal on Computing 11, 620–632

    Article  MathSciNet  MATH  Google Scholar 

  • Klein, P.N. [2008]: A linear-time approximation scheme for TSP in undirected planar graphs with edge-weights. SIAM Journal on Computing 37, 1926–1952

    Article  MathSciNet  MATH  Google Scholar 

  • Krentel, M.W. [1989]: Structure in locally optimal solutions. Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, 216–221

    Google Scholar 

  • Land, A.H., Doig, A.G. [1960]: An automatic method of solving discrete programming problems. Econometrica 28, 497–520

    Article  MathSciNet  MATH  Google Scholar 

  • Lin, S., Kernighan, B.W. [1973]: An effective heuristic algorithm for the traveling-salesman problem. Operations Research 21, 498–516

    Article  MathSciNet  MATH  Google Scholar 

  • Little, J.D.C., Murty, K.G., Sweeny, D.W., Karel, C. [1963]: An algorithm for the traveling salesman problem. Operations Research 11, 972–989

    Article  MATH  Google Scholar 

  • Michiels, W., Aarts, E., Korst, J. [2007]: Theoretical Aspects of Local Search. Springer, Berlin

    MATH  Google Scholar 

  • Mitchell, J. [1999]: Guillotine subdivisions approximate polygonal subdivisions: a simple polynomial-time approximation scheme for geometric TSP, k-MST, and related problems. SIAM Journal on Computing 28, 1298–1309

    Article  MathSciNet  MATH  Google Scholar 

  • Papadimitriou, C.H. [1977]: The Euclidean traveling salesman problem is NP-complete. Theoretical Computer Science 4, 237–244

    Article  MathSciNet  MATH  Google Scholar 

  • Papadimitriou, C.H. [1978]: The adjacency relation on the travelling salesman polytope is NP-complete. Mathematical Programming 14, 312–324

    Article  MathSciNet  MATH  Google Scholar 

  • Papadimitriou, C.H. [1992]: The complexity of the Lin-Kernighan heuristic for the traveling salesman problem. SIAM Journal on Computing 21, 450–465

    Article  MathSciNet  MATH  Google Scholar 

  • Papadimitriou, C.H., Steiglitz, K. [1977]: On the complexity of local search for the traveling salesman problem. SIAM Journal on Computing 6(1), 76–83

    Article  MathSciNet  MATH  Google Scholar 

  • Papadimitriou, C.H., Steiglitz, K. [1978]: Some examples of difficult traveling salesman problems. Operations Research 26, 434–443

    Article  MathSciNet  MATH  Google Scholar 

  • Papadimitriou, C.H., Vempala, S. [2006]: On the approximability of the traveling salesman problem. Combinatorica 26, 101–120

    Article  MathSciNet  MATH  Google Scholar 

  • Papadimitriou, C.H., Yannakakis, M. [1993]: The traveling salesman problem with distances one and two. Mathematics of Operations Research 18, 1–12

    Article  MathSciNet  MATH  Google Scholar 

  • Rao, S.B., Smith, W.D. [1998]: Approximating geometric graphs via “spanners” and “banyans”. Proceedings of the 30th Annual ACM Symposium on Theory of Computing, 540–550

    Google Scholar 

  • Rosenkrantz, D.J. Stearns, R.E., Lewis, P.M. [1977]: An analysis of several heuristics for the traveling salesman problem. SIAM Journal on Computing 6, 563–581

    Article  MathSciNet  MATH  Google Scholar 

  • Sahni, S., Gonzalez, T. [1976]: P-complete approximation problems. Journal of the ACM 23, 555–565

    Article  MathSciNet  MATH  Google Scholar 

  • Shmoys, D.B., Williamson, D.P. [1990]: Analyzing the Held-Karp TSP bound: a monotonicity property with application. Information Processing Letters 35, 281–285

    Article  MathSciNet  MATH  Google Scholar 

  • Triesch, E., Nolles, W., Vygen, J. [1994]: Die Einsatzplanung von Zementmischern und ein Traveling Salesman Problem In: Operations Research; Reflexionen aus Theorie und Praxis (B. Werners, R. Gabriel, eds.), Springer, Berlin [in German]

    Google Scholar 

  • Woeginger, G.J. [2002]: Exact algorithms per NP-hard problems. OPTIMA 68, 2–8

    MathSciNet  Google Scholar 

  • Wolsey, L.A. [1980]: Heuristic analysis, linear programming and branch and bound. Mathematical Programming Study 13, 121–134

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Institute for Discrete Mathematics, University of Bonn, Germany

    Bernhard Korte & Jens Vygen

Authors
  1. Bernhard Korte
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jens Vygen
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Italia

About this chapter

Cite this chapter

Korte, B., Vygen, J. (2011). Il problema del commesso viaggiatore. In: Ottimizzazione Combinatoria. UNITEXT(). Springer, Milano. https://doi.org/10.1007/978-88-470-1523-4_21

Download citation

Publish with us

Policies and ethics

Search

Navigation