| Record ID | harvard_bibliographic_metadata/ab.bib.13.20150123.full.mrc:424886579:1774 |
| Source | harvard_bibliographic_metadata |
| Download Link | /show-records/harvard_bibliographic_metadata/ab.bib.13.20150123.full.mrc:424886579:1774?format=raw |
LEADER: 01774cam a2200361 a 4500
001 013372253-8
005 20130415112427.0
008 050923s2006 gw a b 001 0 eng c
010 $a 2005931374
020 $a3540256849
020 $a9783540256847
035 0 $aocm61715002
040 $aOHX$cOHX$dBAKER$dHNK$dUMC$dMUQ$dYDXCP$dUBA$dUX0$dOCLCG$dSTF$dCDN$dYUS$dE7B$dOCLCQ
042 $apcc
050 4 $aQA402.5$b.K6665 2006
072 7 $aQA$2lcco
082 04 $a519.64$222
100 1 $aKorte, B. H.$q(Bernhard H.),$d1938-
245 10 $aCombinatorial optimization :$btheory and algorithms /$cBernhard Korte, Jens Vygen.
250 $a3rd ed.
260 $aBerlin ;$aNew York :$bSpringer,$cc2006.
300 $axv, 597 p. :$bill. ;$c24 cm.
490 1 $aAlgorithms and combinatorics,$x0937-5511 ;$v21
504 $aIncludes bibliographical references and indexes.
505 0 $a1. Introduction -- 2. Graphs -- 3. Linear programming -- 4. Linear programming algorithms -- 5. Integer programming -- 6. Spanning trees and arborescences -- 7. Shortest paths -- 8. Network flows -- 9. Minimum cost flows -- 10. Maximum matchings -- 11. Weighted matching -- 12. B-matchings and T-joins -- 13. Matroids -- 14. Generalizations of matroids -- 15. NP-completeness -- 16. Approximation algorithms -- 17. The knapsack problem -- 18. Bin-packing -- 19. Multicommodity flows and edge-disjoint paths -- 20. Network design problems -- 21. The traveling salesman problem -- 22. Facility location.
650 0 $aCombinatorial optimization.
650 6 $aOptimisation combinatoire.
650 7 $aOtimização combinatória.$2larpcal
700 1 $aVygen, Jens.
830 0 $aAlgorithms and combinatorics ;$v21.$x0937-5511
988 $a20121006
049 $aHLSS
906 $0OCLC