Coupon
Combinatorial Optimization : Networks and Matroids
by Eugene Lawler


Overview - 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.  Read more...

 
Paperback
  • $24.95

Add to Cart + Add to Wishlist

In Stock Online.

FREE Shipping for Club Members
 
> Check In-Store Availability

In-Store pricing may vary

 
 
New & Used Marketplace 12 copies from $16.76
 
eBook
Retail Price: $24.95
$16.36

Add to Cart + Add to Wishlist

Download

This item is available only to U.S. and Canada billing addresses.
 
 
 

More About Combinatorial Optimization by Eugene Lawler
 
 
 
Overview
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 and concrete computational complexity in departments of computer science and mathematics.

 
Details
  • ISBN-13: 9780486414539
  • ISBN-10: 0486414531
  • Publisher: Dover Publications
  • Publish Date: March 2001
  • Page Count: 384
  • Dimensions: 8.48 x 5.36 x 0.76 inches
  • Shipping Weight: 0.89 pounds

Series: Dover Books on Mathematics

Related Categories

Books > Mathematics > Combinatorics
Books > Mathematics > Game Theory

 
BAM Customer Reviews