TRAVELING SALESMAN PROBLEM
A Computational Study
APPLEGATE, DAVID L. / BIXBY, ROBERT E. / CHVATAL, VASEK / COOK, WILLIAM J.
* Prices displayed are in Australian Dollars and, where applicable, GST inclusive
Description:
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.
Details:
- Publisher: Princeton Univ Pr
- Series: Princeton Series in Applied Mathematics
- Textual Format: Computer Applications
- Academic Level: Scholarly/Graduate
- Depth (m): 0.044
- Dewey: 511
- Height (m): 0.235
- Pages: 593
- Place Of Publication: United States
- Published Date: Mon 15 Jan 2007
- Weight (g): 975
- Width (m): 0.165
Availability
This is an import product, and as such may take longer to source stock, we estimate that despatch will take 14-20 days after ordering, click here for more information regarding import products.
| Also in the Princeton Series in Applied Mathematics series (view all) |
|
|
|
|
More 
