ISBN10: 0691129932, ISBN13: 9780691129938, [publisher: Princeton University Press] Hardcover **SHIPPED FROM UK** We believe you will be completely satisfied with our quick and reliable service. All orders are dispatched as swiftly as possible! Buy with confidence! Greener Books.
[London, United Kingdom] [Publication Year: 2007]

Princeton University Press 02/20/2007 Hardcover Good **SHIPPED FROM UK** We believe you will be completely satisfied with our quick and reliable service. All orders are dispatched as swiftly as possible! Buy with confidence! Greener Books.

ISBN10: 0691129932, ISBN13: 9780691129938, [publisher: Princeton University Press] Hardcover This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. Clean from markings. In good all round condition. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,1050grams, ISBN:9780691129938
[Lincoln, United Kingdom] [Publication Year: 2006]

Princeton University Press, Date: 2006. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. Clean from markings. In good all round condition. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,1050grams, ISBN:9780691129938 2006. Princeton University Press ISBN 0691129932 9780691129938 [GB]

Princeton University Press 2006 Hard cover This is an ex-library book and may have the usual library/used-book markings inside. This book has hardback covers. Clean from markings. In good all round condition. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item, 1050grams, ISBN: 9780691129938.

ISBN10: 0691129932, ISBN13: 9780691129938, [publisher: Princeton University Press] Hardcover Former library book; may include library markings. Used book that is in excellent condition. May show signs of wear or have minor defects.
[Mishawaka, IN, U.S.A.] [Publication Year: 2007]

ISBN10: 0691129932, ISBN13: 9780691129938, [publisher: Princeton University Press] Hardcover Former library book; may include library markings. Used book that is in excellent condition. May show signs of wear or have minor defects.
[Mishawaka, IN, U.S.A.] [Publication Year: 2007]

ISBN10: 0691129932, ISBN13: 9780691129938, [publisher: Princeton University Press] Hardcover
[Columbia, MD, U.S.A.] [Publication Year: 2007]
Show/Hide image

ISBN10: 0691129932, ISBN13: 9780691129938, [publisher: Princeton University Press] Hardcover New Book. Shipped from UK. Established seller since 2000.
[Wood Dale, IL, U.S.A.] [Publication Year: 2007]

ISBN10: 0691129932, ISBN13: 9780691129938, [publisher: Princeton University Press] Hardcover
[Castle Donington, DERBY, United Kingdom] [Publication Year: 2007]
Show/Hide image

Princeton Princeton University Press 2007 Hard cover New. Glued binding. Paper over boards. 608 p. Contains: Illustrations, black & white. Princeton Applied Mathematics, 17.

Princeton University Press 2/4/2007 12: 00: 00 AM Hardcover PLEASE NOTE, WE DO NOT SHIP TO DENMARK. New Book. Shipped from UK in 4 to 14 days. Established seller since 2000. Please note we cannot offer an expedited shipping service from the UK.

Princeton University Press 2007 Hard cover Very Good Collectible-Very Good. Owner's name on inside. Princeton Series in Applied Mathematics, 40. (Mathematics, Applied mathematics, Computational study)

ISBN10: 0691129932, ISBN13: 9780691129938, [publisher: Princeton University Press] Hardcover . Owner's name on inside. Princeton Series in Applied Mathematics, 40. (Mathematics, Applied mathematics, Computational study)
[Frederick, MD, U.S.A.] [Publication Year: 2007]

Princeton University Press 2007-02-04 Hardcover New Size: 9x6x1; New. In shrink wrap. Looks like an interesting title!

ISBN10: 0691129932, ISBN13: 9780691129938, [publisher: Princeton University Press] Hardcover New copy - Usually dispatched within 4 working days. Presents the findings on one of the most intensely investigated subjects in computational mathematics - the travelling salesman problem. This book describes the method and computer code used to solve a range of large-scale problems, and demonstrates the interplay of applied mathematics with increasingly powerful computing platforms.
[Southport, United Kingdom] [Publication Year: 2007]

ISBN10: 0691129932, ISBN13: 9780691129938, [publisher: Princeton University Press 2007-02-20, Princeton |Oxford] Hardcover Language: ENG
[London, United Kingdom] [Publication Year: 2007]

Princeton University Press, Date: 2007-02-04. Hardcover. New. New. In shrink wrap. Looks like an interesting title! 2007. Princeton University Press ISBN 0691129932 9780691129938 [US]

ISBN10: 0691129932, ISBN13: 9780691129938, [publisher: Princeton University Press] Hardcover
[Bayonne, NJ, U.S.A.] [Publication Year: 2007]
Show/Hide image

ISBN10: 0691129932, ISBN13: 9780691129938, [publisher: Princeton University Press] Hardcover 2007. 2nd Printing. Hardcover. Presents the findings on one of the most intensely investigated subjects in computational mathematics - the travelling salesman problem. This book describes the method and computer code used to solve a range of large-scale problems, and demonstrates the interplay of applied mathematics with increasingly powerful computing platforms. Series: Princeton Series in Applied Mathematics. Num Pages: 608 pages, 200 line illus. BIC Classification: PBW; UYA. Category: (P) Professional & Vocational; (U) Tertiary Education (US: College). Dimension: 241 x 165 x 43. Weight in Grams: 1056. . . . . . Books ship from the US and Ireland.
[Olney, MD, U.S.A.] [Publication Year: 2007]

Princeton University Press , pp. 606, Maps . Hardback. New. Princeton University Press ISBN 0691129932 9780691129938 [US]

Princeton Univ Pr, Date: 2007. Hardcover. New. 593 pages. 9.25x6.50x1.75 inches. 2007. Princeton Univ Pr ISBN 0691129932 9780691129938 [GB]

ISBN10: 0691129932, ISBN13: 9780691129938, [publisher: Princeton University Press] Hardcover Buy with confidence! Book is in good condition with minor wear to the pages, binding, and minor marks within
[Amherst, NY, U.S.A.] [Publication Year: 2007]

ISBN10: 0691129932, ISBN13: 9780691129938, [publisher: Princeton University Press] Hardcover
[Denver, CO, U.S.A.] [Publication Year: 2007]

ISBN10: 0691129932, ISBN13: 9780691129938, [publisher: Princeton University Press] Hardcover nach der Bestellung gedruckt Neuware - Printed after ordering - This book presents the latest findings on one of the most intensely investigated subjects in computational mathematics--the traveling salesman problem. It sounds simple enough: given a set of cities and the cost of travel between each pair of them, the problem challenges you to find the cheapest route by which to visit all the cities and return home to where you began. Though seemingly modest, this exercise has inspired studies by mathematicians, chemists, and physicists. Teachers use it in the classroom. It has practical applications in genetics, telecommunications, and neuroscience.The authors of this book are the same pioneers who for nearly two decades have led the investigation into the traveling salesman problem. They have derived solutions to almost eighty-six thousand cities, yet a general solution to the problem has yet to be discovered. Here they describe the method and computer code they used to solve a broad range of large-scale problems, and along the way they demonstrate the interplay of applied mathematics with increasingly powerful computing platforms. They also give the fascinating history of the problem--how it developed, and why it continues to intrigue us.
[Einbeck, Germany] [Publication Year: 2007] ...
Show/Hide image

ISBN10: 0691129932, ISBN13: 9780691129938, [publisher: Princeton University Press] Hardcover Buy for Great customer experience
[Houston, TX, U.S.A.] [Publication Year: 2007]

ISBN10: 0691129932, ISBN13: 9780691129938, [publisher: Princeton University Press, New Jersey] Hardcover Hardcover. This book presents the latest findings on one of the most intensely investigated subjects in computational mathematics--the traveling salesman problem. It sounds simple enough: given a set of cities and the cost of travel between each pair of them, the problem challenges you to find the cheapest route by which to visit all the cities and return home to where you began. Though seemingly modest, this exercise has inspired studies by mathematicians, chemists, and physicists. Teachers use it in the classroom. It has practical applications in genetics, telecommunications, and neuroscience. The authors of this book are the same pioneers who for nearly two decades have led the investigation into the traveling salesman problem. They have derived solutions to almost eighty-six thousand cities, yet a general solution to the problem has yet to be discovered. Here they describe the method and computer code they used to solve a broad range of large-scale problems, and along the way they demonstrate the interplay of applied mathematics with increasingly powerful computing platforms. They also give the fascinating history of the problem--how it developed, and why it continues to intrigue us. Presents the findings on one of the most intensely investigated subjects in computational mathematics - the travelling salesman problem. This book describes the method and computer ...

ISBN10: 0691129932, ISBN13: 9780691129938, [publisher: Princeton University Press, New Jersey] Hardcover Hardcover. This book presents the latest findings on one of the most intensely investigated subjects in computational mathematics--the traveling salesman problem. It sounds simple enough: given a set of cities and the cost of travel between each pair of them, the problem challenges you to find the cheapest route by which to visit all the cities and return home to where you began. Though seemingly modest, this exercise has inspired studies by mathematicians, chemists, and physicists. Teachers use it in the classroom. It has practical applications in genetics, telecommunications, and neuroscience. The authors of this book are the same pioneers who for nearly two decades have led the investigation into the traveling salesman problem. They have derived solutions to almost eighty-six thousand cities, yet a general solution to the problem has yet to be discovered. Here they describe the method and computer code they used to solve a broad range of large-scale problems, and along the way they demonstrate the interplay of applied mathematics with increasingly powerful computing platforms. They also give the fascinating history of the problem--how it developed, and why it continues to intrigue us. Presents the findings on one of the most intensely investigated subjects in computational mathematics - the travelling salesman problem. This book describes the method and computer ...

ISBN10: 0691129932, ISBN13: 9780691129938, [publisher: Princeton University Press] Hardcover
[Moncks Corner, SC, U.S.A.] [Publication Year: 2007]