Skip to content
Cover of Combinatorial optimization

Combinatorial optimization

by Eugene L. Lawler

AlgorithmsCombinatorial optimizationComputational complexityMatroidsNetwork analysis (Planning)Mathematical 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.

Writing a summary for young readers…

For young readers

Book data: Open Library