Combinatorial optimizationEugene L. Lawler
Combinatorial optimization
Eugene L. Lawler · 1975
Where to buy
Check today’s price on Amazon. We do not show prices because they change daily.
View on AmazonAffiliate link. As an Amazon Associate we earn from qualifying purchases.
About the book
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.
Book details
- Year
- 1975
- Language
- English
- Publisher
- Oxford University Press, USA
- Editions
- 2
- Pages
- 384
- ISBN
- 9780030848667
Data source: Wikidata
