Combinatorial Optimization: Networks and Matroids by Mathematics, Eugene S. Lawler

Combinatorial Optimization: Networks and Matroids

Dover Books on Mathematics

Mathematics, Eugene S. Lawler

384 pages missing pub info (editions)

nonfiction mathematics medium-paced
Powered by AI (Beta)
Loading...

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 th...

Read more

Community Reviews

Loading...

Content Warnings

Loading...