Welcome to Loot.co.za! Sign in / Register |Wishlists & Gift Vouchers |Help | Advanced search

Checkout
- Your Cart Price

Your cart

Your cart is empty

Books > Science & Mathematics > Mathematics > Combinatorics & graph theory

Buy Now

The Traveling Salesman Problem and Its Variations (Hardcover, 2002 ed.) Loot Price: R8,422

Discovery Miles 84 220

Repayment Terms: R789 pm x 12*

Add to cart

The Traveling Salesman Problem and Its Variations (Hardcover, 2002 ed.): G. Gutin, A. P. Punnen

The Traveling Salesman Problem and Its Variations (Hardcover, 2002 ed.)

G. Gutin, A. P. Punnen

Series: Combinatorial Optimization, 12

(sign in to rate)

Loot Price R8,422 Discovery Miles 84 220 | Repayment Terms: R789 pm x 12*

Expected to ship within 12 - 17 working days

Description
Details
Customer Reviews

A brilliant treatment of a knotty problem in computing. This volume contains chapters written by reputable researchers and provides the state of the art in theory and algorithms for the traveling salesman problem (TSP). The book covers all important areas of study on TSP, including polyhedral theory for symmetric and asymmetric TSP, branch and bound, and branch and cut algorithms, probabilistic aspects of TSP, and includes a thorough computational analysis of heuristic and metaheuristic algorithms.

General

Imprint:	Springer-Verlag New York
Country of origin:	United States
Series:	Combinatorial Optimization, 12
Release date:	May 2002
First published:	2007
Editors:	G. Gutin • A. P. Punnen
Dimensions:	235 x 155 x 44mm (L x W x T)
Format:	Hardcover
Pages:	830
Edition:	2002 ed.
ISBN-13:	978-1-4020-0664-7
Categories:	Books > Science & Mathematics > Mathematics > Combinatorics & graph theory Promotions
LSN:	1-4020-0664-0
Barcode:	9781402006647