 |
|
|
Item Details
| Title:
|
THE TRAVELING SALESMAN PROBLEM
A GUIDED TOUR OF COMBINATORIAL OPTIMIZATION |
| By: |
E.L. Lawler, Jan Karel Lenstra, A. H. G. Rinnooy Kan |
| Format: |
Hardback |
| List price:
|
£396.95 |
|
We currently do not stock this item, please contact the publisher directly for
further information.
|
|
|
|
|
|
| ISBN 10: |
0471904139 |
| ISBN 13: |
9780471904137 |
| Publisher: |
JOHN WILEY AND SONS LTD |
| Pub. date: |
28 August, 1985 |
| Series: |
Wiley Series in Discrete Mathematics and Optimization |
| Pages: |
476 |
| Description: |
Provides an in-depth treatment of the Traveling Salesman problem--the archetypical problem in combinatorial optimization. Each chapter deals with a different aspect of the problem, and has been written by an acknowledged expert in the field. Focusses on the essential ideas in a self-contained manner. |
| Synopsis: |
Provides an in-depth treatment of the Traveling Salesman problem--the archetypical problem in combinatorial optimization. Each chapter deals with a different aspect of the problem, and has been written by an acknowledged expert in the field. Focusses on the essential ideas in a self-contained manner. Includes exercises and an extensive bibliography. |
| Illustrations: |
illustrations, bibliography |
| Publication: |
UK |
| Imprint: |
John Wiley & Sons Ltd |
| Returns: |
Returnable |
|
|
|
 |
|
|
|
|
|
No Cheese, Please!
A fun picture book for children with food allergies - full of friendship and super-cute characters!Little Mo the mouse is having a birthday party.
|
My Brother Is a Superhero
Luke is massively annoyed about this, but when Zack is kidnapped by his arch-nemesis, Luke and his friends have only five days to find him and save the world...
|
|
|
|
|