An edition of Combinatorial optimization
(1975)
Combinatorial optimization
networks and matroids
by Eugene L. Lawler
- 0 Ratings
- 1 Want to read
- 0 Currently reading
- 0 Have read
Share
×Close
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.
Check nearby libraries
Buy this book
Previews available in: English
Showing 4 featured editions. View all 4 editions?
| Edition | Availability |
|---|---|
1
Combinatorial optimization: networks and matroids
2001, Dover Publications
in English
0486414531 9780486414539
|
zzzz
Libraries near you:
WorldCat
|
2
Combinatorial optimization: networks and matroids
1976, Holt, Rinehart and Winston
in English
0030848660 9780030848667
|
aaaa
Libraries near you:
WorldCat
|
3
Combinatorial Optimization: Networks and Matroids
December 31, 1975, Oxford University Press, USA
in English
0030848660 9780030848667
|
zzzz
Libraries near you:
WorldCat
|
4
Combinatorial Optimization: Networks and Matroids
December 31, 1975, Oxford University Press, USA
Hardcover
in English
0030848660 9780030848667
|
zzzz
Libraries near you:
WorldCat
|
Book Details
Edition Notes
Includes bibliographical references and indexes.
Classifications
The Physical Object
ID Numbers
Source records
Community Reviews (0)
Feedback?
| December 10, 2023 | Edited by MARC Bot | import existing book |
| December 7, 2022 | Edited by MARC Bot | import existing book |
| June 17, 2022 | Edited by ImportBot | import existing book |
| December 4, 2010 | Edited by Open Library Bot | Added subjects from MARC records. |
| December 10, 2009 | Created by WorkBot | add works page |