Lingua: Inglese
Editore: Princeton University Press, 2007
ISBN 10: 0691129932 ISBN 13: 9780691129938
Condizione: Very Good. . Owner's name on inside. Princeton Series in Applied Mathematics, 40. (Mathematics, Applied mathematics, Computational study).
Lingua: Inglese
Editore: Princeton University Press, 2007
ISBN 10: 0691129932 ISBN 13: 9780691129938
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. pp. 606, Maps.
Lingua: Inglese
Editore: Princeton University Press, 2007
ISBN 10: 0691129932 ISBN 13: 9780691129938
Da: Majestic Books, Hounslow, Regno Unito
EUR 101,50
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: New. pp. 606 Illus., Maps.
Lingua: Inglese
Editore: Princeton University Press, 2007
ISBN 10: 0691129932 ISBN 13: 9780691129938
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: As New. Unread book in perfect condition.
Lingua: Inglese
Editore: Princeton University Press, 2007
ISBN 10: 0691129932 ISBN 13: 9780691129938
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New.
Lingua: Inglese
Editore: Princeton University Press, 2007
ISBN 10: 0691129932 ISBN 13: 9780691129938
Da: Biblios, Frankfurt am main, HESSE, Germania
EUR 104,36
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: New. pp. 606.
Lingua: Inglese
Editore: Princeton University Press, US, 2007
ISBN 10: 0691129932 ISBN 13: 9780691129938
Da: Rarewaves USA, OSWEGO, IL, U.S.A.
EUR 119,31
Quantità: Più di 20 disponibili
Aggiungi al carrelloHardback. Condizione: 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.
Lingua: Inglese
Editore: Princeton University Press, 2007
ISBN 10: 0691129932 ISBN 13: 9780691129938
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 118,10
Quantità: 2 disponibili
Aggiungi al carrelloCondizione: New.
Lingua: Inglese
Editore: Princeton University Press, 2007
ISBN 10: 0691129932 ISBN 13: 9780691129938
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 118,10
Quantità: 2 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Lingua: Inglese
Editore: Princeton University Press, 2007
ISBN 10: 0691129932 ISBN 13: 9780691129938
Da: BennettBooksLtd, Los Angeles, CA, U.S.A.
hardcover. Condizione: New. In shrink wrap. Looks like an interesting title!
Lingua: Inglese
Editore: Princeton University Press, US, 2007
ISBN 10: 0691129932 ISBN 13: 9780691129938
Da: Rarewaves USA United, OSWEGO, IL, U.S.A.
EUR 122,69
Quantità: Più di 20 disponibili
Aggiungi al carrelloHardback. Condizione: 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.
Da: Revaluation Books, Exeter, Regno Unito
EUR 174,49
Quantità: 2 disponibili
Aggiungi al carrelloHardcover. Condizione: Brand New. 593 pages. 9.25x6.50x1.75 inches. In Stock.
Da: Revaluation Books, Exeter, Regno Unito
EUR 125,45
Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: Brand New. 593 pages. 9.25x6.50x1.75 inches. In Stock. This item is printed on demand.