Combinational Optimization

By:

Lawler Lawler

Format:

Paperback / softback

Series:

Dover Books on MaTHEMA 1.4tics

Show Hide Adult Content

$50.99

Available from supplier

Usually ships in 3-4 weeks

0 in Trolley

Price Match

Wrap this item as a gift ($5.90) - add a free gift card on the next page

Buy Now, Pay Later with:

Afterpay is available on orders $100 to $2000 Learn more

Availability

Delivering to:

Estimated arrival:

Around 25 Jun - 5 Jul using International Courier

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 the greedy algorithm, matroid intersections, and the matroid parity problems. A suitable text or reference for courses in combinatorial computing.

Release date Australia

March 28th, 2003

Author

Lawler Lawler

Audience

General (US: Trade)

Pages

374

Series

Dover Books on MaTHEMA 1.4tics

Dimensions

135x215x20

ISBN-13

9780486414539

Product ID

11978193

Customer reviews

Nobody has reviewed this product yet. You could be the first!

Write a Review

Marketplace listings

There are no Marketplace listings available for this product currently.
Already own it? Create a free listing and pay just 9% commission when it sells!

Sell Yours Here

Get free delivery, exclusive deals, and more^*

Non-Fiction Books:

Combinational Optimization

By:

Format:

Series:

Buy Now, Pay Later with:

Availability

Description

Customer reviews

Marketplace listings

Help & options

Filed under...

Get free delivery, exclusive deals, and more*

Buy Now, Pay Later with:

Get free delivery, exclusive deals, and more^*