| Record ID | harvard_bibliographic_metadata/ab.bib.00.20150123.full.mrc:352116260:1784 |
| Source | harvard_bibliographic_metadata |
| Download Link | /show-records/harvard_bibliographic_metadata/ab.bib.00.20150123.full.mrc:352116260:1784?format=raw |
LEADER: 01784pam a2200289 a 4500
001 000453212-0
005 20020606090541.3
008 850130s1985 enka b 00100 eng
010 $a 85003158
020 $a0471904139 :$c$57.00
035 0 $aocm11756468
040 $aDLC$cDLC
050 00 $aQA164$b.T73 1985
245 04 $aThe Traveling salesman problem :$ba guided tour of combinatorial optimization /$cedited by E.L. Lawler ... [et al.].
260 0 $aChichester [West Sussex] ;$aNew York :$bWiley,$cc1985.
300 $ax, 465 p. :$bill. ;$c25 cm.
440 0 $aWiley-Interscience series in discrete mathematics
500 $a"A Wiley-Interscience publication."
504 $aBibliography: p. 449-465.
505 0 $aHistory / 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 -- Probabilistic analysis of heuristics / R.M. Karp, J.M. Steele -- Empirical analysis of heuristics / B.L. Golden, W.R. Stewart -- Polyhedral theory / M. Grötschel, M.W. Padberg -- Polyhedral computations / M.W. Padberg, M. Grötschel -- Branch and bound methods / E. Balas, P. Toth -- Hamiltonian cycles / V. Chvátal -- Vehicle routing / N. Christofides.
650 0 $aCombinatorial optimization.
650 0 $aTraveling-salesman problem.
700 1 $aLawler, Eugene L.
776 08 $iOnline version:$tTraveling salesman problem.$dChichester [West Sussex] ; New York : Wiley, ©1985$w(OCoLC)567460994
776 08 $iOnline version:$tTraveling salesman problem.$dChichester [West Sussex] ; New York : Wiley, ©1985$w(OCoLC)606365119
988 $a20020608
906 $0DLC