Check nearby libraries
Buy this book
This edition doesn't have a description yet. Can you add one?
Check nearby libraries
Buy this book
Previews available in: English
Edition | Availability |
---|---|
1
The traveling salesman problem: a computational study
2006, Princeton University Press
in English
0691129932 9780691129938
|
aaaa
|
Book Details
Table of Contents
The problem
Applications
Dantzig, Fulkerson, and Johnson
History of TSP computation
LP bounds and cutting planes
Subtour cuts and PQ-trees
Cuts from blossoms and blocks
Combs from consecutive ones
Combs from dominoes
Cut metamorphoses
Local cuts
Managing the linear programming problems
The linear programming solver
Branching
Tour finding
Computation
The road goes on
Edition Notes
Includes bibliographical references (p. [541]-581) and index
Classifications
The Physical Object
ID Numbers
Community Reviews (0)
Feedback?December 29, 2022 | Edited by MARC Bot | import existing book |
January 26, 2022 | Edited by ImportBot | import existing book |
February 12, 2019 | Edited by MARC Bot | import existing book |
February 4, 2019 | Created by MARC Bot | import existing book |