๐”– Scriptorium
โœฆ   LIBER   โœฆ
๐Ÿ“

The Traveling Salesman Problem and Its Variations (Combinatorial Optimization)

โœ Scribed by G. Gutin, A.P. Punnen (Editors)

Year
2002
Tongue
English
Leaves
849
Edition
1
Category
Library
โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The Traveling Salesman Problem and Its V
๐Ÿ“ The Traveling Salesman Problem and Its Variations
โœ G. Gutin, A.P. Punnen ๐Ÿ“‚ Library ๐Ÿ“… 2002 ๐Ÿ› Springer Netherlands ๐ŸŒ English

This volume, which contains chapters written by reputable researchers, 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 bo

The Traveling Salesman Problem and Its V
๐Ÿ“ The Traveling Salesman Problem and Its Variations
โœ Abraham P. Punnen (auth.), Gregory Gutin, Abraham P. Punnen (eds.) ๐Ÿ“‚ Library ๐Ÿ“… 2007 ๐Ÿ› Springer US ๐ŸŒ English

<p><P>This volume, which contains chapters written by reputable researchers, 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

The Traveling Salesman Problem and Its V
๐Ÿ“ The Traveling Salesman Problem and Its Variations
โœ Abraham P. Punnen (auth.), Gregory Gutin, Abraham P. Punnen (eds.) ๐Ÿ“‚ Library ๐Ÿ“… 2007 ๐Ÿ› Springer US ๐ŸŒ English

<p><P>This volume, which contains chapters written by reputable researchers, 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

The Traveling Salesman Problem: A Guided
๐Ÿ“ The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization
โœ E. L. Lawler, Jan Karel Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys ๐Ÿ“‚ Library ๐Ÿ“… 1985 ๐Ÿ› Wiley ๐ŸŒ English

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

The Traveling salesman problem : a guide
๐Ÿ“ The Traveling salesman problem : a guided tour of combinatorial optimization
โœ Lawler E.L., et al. (eds.) ๐Ÿ“‚ Library ๐Ÿ“… 1985 ๐Ÿ› Wiley ๐ŸŒ English

History / A.J. Hoffman, P. Wolfe -- Motivation and modeling / R.S. Garfinkel -- Computational complexity / D.S. Johnson, C.H. Papadimitriou -- Well-solved special cases / P.C. Gilmore, E.L. Lawler, D.B. Shmoys -- Performance guarantees for heuristics / D.S. Johnson, C.H. Papadimitriou -- Probabilis