|
| Satz 1 von 1 |
  |
|
| |
|
The traveling salesman problem: a computational study
| |
|
1. Person/Familie
|
Applegate, David L.
|
|
2. Person/Familie
|
Bixby, Robert E.
|
|
3. Person/Familie
|
Chvatal, Vasek
|
|
4. Person/Familie
|
Cook, William J.
|
|
Titel
|
The traveling salesman problem: a computational study
|
|
Verantw.-ang.
|
David L. Applegate , Robert E. Bixby, Vasek Chvátal, Wiliam J. Cook
|
|
Verlagsort
|
Princeton [u.a.]
|
|
Verlag
|
Princeton Univ. Press
|
|
E-Jahr
|
2006
|
|
Umfangsangabe
|
IX, 593 S.
|
|
Andere Details zur phys. Beschr.
|
Ill., graph. Darst.
|
|
HT 1. Reihe u. Zähl.
|
Princeton series in applied mathematics 
|
|
Weitere Angaben
|
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.. - Includes bibliographical references (p. [541] - 581) and index
|
|
ISBN
|
0-691-12993-2 (hbk. : alk. paper)
|
|
ISBN
|
978-0-691-12993-8 (hbk. : alk. paper)
|
|
Notation
|
90C27
|
|
Notation
|
90C35
|
|
Notation
|
90-02
|
|
Bestand
|
1
|
|
Sign-Info
|
90C27 App
|
|
|
Hilfe
Korb
RSS
