Matches in Harvard for { <http://id.lib.harvard.edu/aleph/000338503/catalog> ?p ?o. }
Showing items 1 to 28 of
28
with 100 items per page.
- catalog abstract "Perceptively 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.".
- catalog contributor b392006.
- catalog created "c1976.".
- catalog date "1976".
- catalog date "c1976.".
- catalog dateCopyrighted "c1976.".
- catalog description "Includes bibliographical references and indexes.".
- catalog description "Introduction -- Mathematical preliminaries -- Shortest paths -- Network flows -- Bipartite matching -- Nonbipartite matching -- Matroids and the greedy algorithm -- Matroid intersections -- The matroid parity problem.".
- catalog description "Perceptively 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.".
- catalog extent "x, 374 p. :".
- catalog hasFormat "Combinatorial optimization.".
- catalog identifier "0030848660".
- catalog isFormatOf "Combinatorial optimization.".
- catalog issued "1976".
- catalog issued "c1976.".
- catalog language "eng".
- catalog publisher "New York : Holt, Rinehart and Winston,".
- catalog relation "Combinatorial optimization.".
- catalog subject "519.7".
- catalog subject "Algorithms.".
- catalog subject "Combinatorial optimization.".
- catalog subject "Computational complexity.".
- catalog subject "Matroids.".
- catalog subject "Network analysis (Planning)".
- catalog subject "QA402.5 .L39".
- catalog tableOfContents "Introduction -- Mathematical preliminaries -- Shortest paths -- Network flows -- Bipartite matching -- Nonbipartite matching -- Matroids and the greedy algorithm -- Matroid intersections -- The matroid parity problem.".
- catalog title "Combinatorial optimization : networks and matroids / Eugene L. Lawler.".
- catalog type "text".