MARC Record from Miami University of Ohio

LEADER: 01573cam 2200289Ia 4500
001 ocm83853510
005 20070328000000.0
008 070215s2006 njuab b 001 0 eng d
010 $a2006931528
020 $a0691129932 (hardcover : alk. paper)
020 $a9780691129938 (hardcover : alk. paper)
040 $aCOA$cCOA$dBAKER$dYDXCP$dABF
049 $aMIAS
050 14 $aQA164$b.T72 2006
245 04 $aThe traveling salesman problem :$ba computational study /$cDavid L. Applegate ... [et al.]
260 $aPrinceton, N.J. :$bPrinceton University Press,$cc2006
300 $aix, 593 p. :$bill., maps ;$c24 cm
440 0 $aPrinceton series in applied mathematics
504 $aIncludes bibliographical references (p. [541]-581) and index
505 0 $aThe 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
650 0 $aTraveling-salesman problem
650 0 $aCombinatorial optimization
700 1 $aApplegate, David L
907 $a.b3516007x$b04-09-07$c03-29-07
998 $ascl$b04-09-07$cm$da$e-$feng$gnju$h4$i0
947 $akis
945 $g1$i35054030260695$j0$lscli $nreceipt time 04-06-2007/2/2:57:54 PM/2:57:58 PM/2:58:03 PM/2:58:09 PM $o-$p$0.00$q-$r-$s-$t0$u0$v0$w0$x0$y.i44428637$z04-06-07