Idioma: Inglés
Publicado por Princeton University Press, 2007
ISBN 10: 0691129932 ISBN 13: 9780691129938
Librería: Wonder Book, Frederick, MD, Estados Unidos de America
EUR 61,42
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: Very Good. . Owner's name on inside. Princeton Series in Applied Mathematics, 40. (Mathematics, Applied mathematics, Computational study).
Idioma: Inglés
Publicado por Princeton University Press, 2007
ISBN 10: 0691129932 ISBN 13: 9780691129938
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
EUR 83,26
Cantidad disponible: 1 disponibles
Añadir al carritoHRD. Condición: New. New Book. Shipped from UK. Established seller since 2000.
Idioma: Inglés
Publicado por Princeton University Press, 2007
ISBN 10: 0691129932 ISBN 13: 9780691129938
Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
EUR 94,93
Cantidad disponible: 1 disponibles
Añadir al carritoHRD. Condición: New. New Book. Shipped from UK. Established seller since 2000.
Idioma: Inglés
Publicado por Princeton University Press, 2007
ISBN 10: 0691129932 ISBN 13: 9780691129938
Librería: GoldBooks, Denver, CO, Estados Unidos de America
EUR 95,77
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: new. New Copy. Customer Service Guaranteed.
Idioma: Inglés
Publicado por Princeton University Press, 2007
ISBN 10: 0691129932 ISBN 13: 9780691129938
Librería: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
EUR 93,86
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: New. 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. . . . . .
Idioma: Inglés
Publicado por Princeton University Press, 2007
ISBN 10: 0691129932 ISBN 13: 9780691129938
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 103,95
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: New. pp. 606, Maps.
Idioma: Inglés
Publicado por Princeton University Press, 2007
ISBN 10: 0691129932 ISBN 13: 9780691129938
Librería: Majestic Books, Hounslow, Reino Unido
EUR 101,80
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: New. pp. 606 Illus., Maps.
Idioma: Inglés
Publicado por Princeton University Press, 2007
ISBN 10: 0691129932 ISBN 13: 9780691129938
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 110,57
Cantidad disponible: 2 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Idioma: Inglés
Publicado por Princeton University Press, 2007
ISBN 10: 0691129932 ISBN 13: 9780691129938
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 110,57
Cantidad disponible: 2 disponibles
Añadir al carritoCondición: New.
Idioma: Inglés
Publicado por Princeton University Press, 2007
ISBN 10: 0691129932 ISBN 13: 9780691129938
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 104,36
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: New. pp. 606.
Idioma: Inglés
Publicado por Princeton University Press, US, 2007
ISBN 10: 0691129932 ISBN 13: 9780691129938
Librería: Rarewaves USA, OSWEGO, IL, Estados Unidos de America
EUR 119,65
Cantidad disponible: Más de 20 disponibles
Añadir al carritoHardback. Condición: New. 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.
Idioma: Inglés
Publicado por Princeton University Press, 2007
ISBN 10: 0691129932 ISBN 13: 9780691129938
Librería: Kennys Bookstore, Olney, MD, Estados Unidos de America
EUR 117,10
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: New. 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.
Idioma: Inglés
Publicado por Princeton University Press, 2007
ISBN 10: 0691129932 ISBN 13: 9780691129938
Librería: THE SAINT BOOKSTORE, Southport, Reino Unido
EUR 107,19
Cantidad disponible: 1 disponibles
Añadir al carritoHardback. Condición: New. New copy - Usually dispatched within 4 working days.
Idioma: Inglés
Publicado por Princeton University Press, 2007
ISBN 10: 0691129932 ISBN 13: 9780691129938
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 118,08
Cantidad disponible: 2 disponibles
Añadir al carritoCondición: New.
Idioma: Inglés
Publicado por Princeton University Press, 2007
ISBN 10: 0691129932 ISBN 13: 9780691129938
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 118,08
Cantidad disponible: 2 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Idioma: Inglés
Publicado por Princeton University Press, 2007
ISBN 10: 0691129932 ISBN 13: 9780691129938
Librería: BennettBooksLtd, Los Angeles, CA, Estados Unidos de America
EUR 131,46
Cantidad disponible: 1 disponibles
Añadir al carritohardcover. Condición: New. In shrink wrap. Looks like an interesting title!
Idioma: Inglés
Publicado por Princeton University Press, US, 2007
ISBN 10: 0691129932 ISBN 13: 9780691129938
Librería: Rarewaves USA United, OSWEGO, IL, Estados Unidos de America
EUR 122,66
Cantidad disponible: Más de 20 disponibles
Añadir al carritoHardback. Condición: New. 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.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 174,45
Cantidad disponible: 2 disponibles
Añadir al carritoHardcover. Condición: Brand New. 593 pages. 9.25x6.50x1.75 inches. In Stock.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 125,42
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Brand New. 593 pages. 9.25x6.50x1.75 inches. In Stock. This item is printed on demand.
Idioma: Inglés
Publicado por Princeton University Press, 2007
ISBN 10: 0691129932 ISBN 13: 9780691129938
Librería: moluna, Greven, Alemania
EUR 92,86
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 int.
Idioma: Inglés
Publicado por Princeton University Press, 2007
ISBN 10: 0691129932 ISBN 13: 9780691129938
Librería: preigu, Osnabrück, Alemania
EUR 96,35
Cantidad disponible: 5 disponibles
Añadir al carritoBuch. Condición: Neu. The Traveling Salesman Problem | A Computational Study | David L. Applegate (u. a.) | Buch | Gebunden | Englisch | 2007 | Princeton University Press | EAN 9780691129938 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand.
Idioma: Inglés
Publicado por Princeton University Press, 2007
ISBN 10: 0691129932 ISBN 13: 9780691129938
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 117,00
Cantidad disponible: 1 disponibles
Añadir al carritoBuch. Condición: Neu. 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.