| Record ID | harvard_bibliographic_metadata/ab.bib.00.20150123.full.mrc:260162226:1615 |
| Source | harvard_bibliographic_metadata |
| Download Link | /show-records/harvard_bibliographic_metadata/ab.bib.00.20150123.full.mrc:260162226:1615?format=raw |
LEADER: 01615cam a2200313 i 4500
001 000338503-5
005 20020606090541.3
008 760417s1976 nyua b 001 0 eng
010 $a 76013516 //r84
020 $a0030848660
035 0 $aocm02189076
040 $aDLC$cDLC$dMCS
050 0 $aQA402.5$b.L39
082 $a519.7
100 1 $aLawler, Eugene L.
245 10 $aCombinatorial optimization :$bnetworks and matroids /$cEugene L. Lawler.
260 $aNew York :$bHolt, Rinehart and Winston,$cc1976.
300 $ax, 374 p. :$bill. ;$c24 cm.
504 $aIncludes bibliographical references and indexes.
520 $aPerceptively written text examines optimization problems that can be formulated in terms of networks and algebraic structures called matroids. Chapters cover shortest paths, network flows, bipartite matching, nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. A suitable text or reference for courses in combinatorial computing.
505 0 $aIntroduction -- Mathematical preliminaries -- Shortest paths -- Network flows -- Bipartite matching -- Nonbipartite matching -- Matroids and the greedy algorithm -- Matroid intersections -- The matroid parity problem.
650 0 $aCombinatorial optimization.
650 0 $aMatroids.
650 0 $aNetwork analysis (Planning)
650 0 $aComputational complexity.
650 0 $aAlgorithms.
776 08 $iOnline version:$aLawler, Eugene L.$tCombinatorial optimization.$dNew York : Holt, Rinehart and Winston, ©1976$w(OCoLC)565258259
988 $a20020608
906 $0DLC