Combinatorial optimization
AlgorithmsCombinatorial optimizationComputational complexityMatroidsNetwork analysis (Planning)
0.0
Open LibraryAbout this 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.
Themes & subjects
AlgorithmsCombinatorial optimizationComputational complexityMatroidsNetwork analysis (Planning)Mathematical optimization
Reviews
No reviews yet — be the first to write one from the Log screen.
Quotes
No quotes yet.
