Combinatorial Optimization: Networks and Matroids
Combinatorial Optimization: Networks and Matroids is backordered and will ship as soon as it is back in stock.
Couldn't load pickup availability
Genuine Products Guarantee
Genuine Products Guarantee
We guarantee 100% genuine products, and if proven otherwise, we will compensate you with 10 times the product's cost.
Delivery and Shipping
Delivery and Shipping
Products are generally ready for dispatch within 1 day and typically reach you in 3 to 5 days.
Combinatorial Optimization: Networks and Matroids
Author: Eugene Lawler
Brand: Dover
Edition: Reprint
Binding: paperback
Number Of Pages: 384
Release Date: 13-10-2011
Details: 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.
EAN: 0800759414536
Package Dimensions: 8.4 x 5.4 x 1.0 inches
Languages: English
