
Combinatorial optimization
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.
- Genres
- Algorithms, Combinatorial optimization, Computational complexity, Matroids, Network analysis (Planning), Mathematical optimization
- Author
- Eugene L. Lawler
- Pages
- 379
Where to find it
Some links are affiliate links: if you buy, the site may receive a commission at no extra cost to you.







