DISCLOSURE:
When you click on links to various merchants on this site and make a purchase, this can result in this site earning a commission at no extra cost to you. Affiliate programs and affiliations include, but are not limited to, the eBay Partner Network, Amazon and Alibris.
ISBN10: 0387444599, ISBN13: 9780387444598, [publisher: Springer] Softcover Book is in Used-VeryGood condition. Pages and cover are clean and intact. Used items may not include supplementary materials such as CDs or access codes. May show signs of minor shelf wear and contain very limited notes and highlighting. [Hawthorne, CA, U.S.A.] [Publication Year: 2007]
ISBN10: 0387444599, ISBN13: 9780387444598, [publisher: Springer] Softcover Good condition. This is the average used book, that has all pages or leaves present, but may include writing. Book may be ex-library with stamps and stickers. [Tucson, AZ, U.S.A.] [Publication Year: 2007]
ISBN10: 0387444599, ISBN13: 9780387444598, [publisher: Springer US] Softcover Druck auf Anfrage Neuware - Printed after ordering - This volume, which contains chapters written by reputable researchers, 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, thorough computational analysis of heuristic and metaheuristic algorithms, theoretical analysis of approximation algorithms, including the emerging area of domination analysis of algorithms, discussion of TSP software and variations of TSP such as bottleneck TSP, generalized TSP, prize collecting TSP, maximizing TSP, orienteering problem, etc. AudienceThis book is intended for researchers, practitioners, and academicians in mathematics, computer science, and operations research. It is appropriate as a reference work or as a main or supplemental textbook in graduate and senior undergraduate courses and projects. [Einbeck, Germany] [Publication Year: 2007]
New. New Book; Fast Shipping from UK; Not signed; Not First Edition; The The Traveling Salesman Problem and Its Variations. ISBN 0387444599 9780387444598 [GB]
ISBN10: 0387444599, ISBN13: 9780387444598, [publisher: Springer US] Softcover Druck auf Anfrage Neuware - Printed after ordering - This volume, which contains chapters written by reputable researchers, 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, thorough computational analysis of heuristic and metaheuristic algorithms, theoretical analysis of approximation algorithms, including the emerging area of domination analysis of algorithms, discussion of TSP software and variations of TSP such as bottleneck TSP, generalized TSP, prize collecting TSP, maximizing TSP, orienteering problem, etc. AudienceThis book is intended for researchers, practitioners, and academicians in mathematics, computer science, and operations research. It is appropriate as a reference work or as a main or supplemental textbook in graduate and senior undergraduate courses and projects. [Einbeck, Germany] [Publication Year: 2007]
ISBN10: 0387444599, ISBN13: 9780387444598, [publisher: Springer] Softcover Book is in Used-LikeNew condition. Pages and cover are clean and intact. Used items may not include supplementary materials such as CDs or access codes. May show signs of minor shelf wear. [Hawthorne, CA, U.S.A.] [Publication Year: 2007]
ISBN10: 0387444599, ISBN13: 9780387444598, [publisher: Springer] Softcover New! This book is in the same immaculate condition as when it was published [Tucson, AZ, U.S.A.] [Publication Year: 2007]
DISCLOSURE:
When you click on links to various merchants on this site and make a purchase, this can result in this site earning a commission at no extra cost to you. Affiliate programs and affiliations include, but are not limited to, the eBay Partner Network, Amazon and Alibris.
