Web2.0館藏資料查詢系統


資料來源: Google Book

The traveling salesman problem and its variations

  • 其他作者: Gutin, Gregory, , Punnen, Abraham P.
  • 出版: Dordrecht ;Boston : Kluwer Academic Publishers ©2002.
  • 稽核項: 1 online resource (xviii, 830 pages) :illustrations.
  • 叢書名: Combinatorial optimization ;v. 12
  • 標題: Traveling salesman problem. , Combinatorial optimization. , Combinatorics. , MATHEMATICS Combinatorics. , Electronic book. , Problèmes de tournées. , Electronic books. , MATHEMATICS , Optimisation combinatoire.
  • ISBN: 1402006640 , 9781402006647
  • 試查全文@TNUA:
  • 附註: Includes bibliographical references (pages 761-806) and index. The Traveling salesman problem: applications, formulations, and variations / Abraham P. Punnen -- Polyhedral theory and branch-and-cut algorithms for the symmetric TSP / Denis Naddef -- Polyhedral theory for the asymmetric traveling salesman problem / Egon Balas, Matteo Fischetti -- Exact methods for the asymmetric traveling salesman problem / Matteo Fischetti, Andrea Lodi, Paolo Toth -- Approximation algorithms for geometric TSP / Sanjeev Arora -- Exponential neighborhoods and domination analysis for the TSP / Gregory Gutin, Anders Yeo, Alexei Zverovitch -- Probabilistic analysis of the TSP / A.M. Frieze, J.E. Yukich -- Local search and metaheuristics / César Rego, Fred Flover -- Experimental analysis of heuristics for the STSP / David S. Johnson, Lyle A. McGeoch -- Experimental analysis of heuristics for the ATSP / David S. Johnson [and others] -- Polynomially solvable cases of the TSP / Santosh N. Kabadi -- The maximum TSP / Alexander Barvinok, Edward Kh. Gimadi, Anatoliy I. Serdyukov -- The generalized traveling salesman and orienteering problems / Matteo Fischetti, Juan-JoséSlazar-González, Paolo Toth -- The prize collecting Traveling salesman problem and its applications / Egon Balas -- The bottleneck TSP / Santosh N. Kabadi, Abraham P. Punnen -- TSP software / Andrea Lodi, Abraham P. Punnen.
  • 摘要: This volume provides information on theory and algorithms for the traveling salesman problem (TSP). The book covers all important areas of study on TSP, including polyhedral theory for symmetric and asymmetric TSP, and branch and bound, and branch and cut algorithms.
  • 電子資源: https://dbs.tnua.edu.tw/login?url=https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=99507
  • 系統號: 005307557
  • 資料類型: 電子書
  • 讀者標籤: 需登入
  • 引用網址: 複製連結
A brilliant treatment of a knotty problem in computing. This volume contains chapters written by reputable researchers and provides the state of the art in theory and algorithms for the traveling salesman problem (TSP). The book covers all important areas of study on TSP, including polyhedral theory for symmetric and asymmetric TSP, branch and bound, and branch and cut algorithms, probabilistic aspects of TSP, and includes a thorough computational analysis of heuristic and metaheuristic algorithms.
來源: Google Book
評分

地址： © 2013 All rights reserved.