Combinatorial Optimization: Networks and Matroids

Combinatorial Optimization: Networks and Matroids

ISBN 13:  9780486414539

FREE Shipping on 3 books or more! - for all UK orders - find out more


Usually ships in 21 days  

Usually ships in 21 days

Author  Lawler
Format  Paperback
No. of Pages  374
Brand:  Dover Publications

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.

Illustrations: -
Author: Lawler
Size: -
Format: Book
Copyright: -
ISBN 13: 9780486414539

Be the first to Write a Review for this item!

UK Delivery

Order 3 or more books to enjoy FREE UK delivery!

Method Cost for Single Book Additional Book
UK Standard £2.95 £0.55   *  Order 3 + books for FREE delivery
UK First Class £3.90 £2.00


Method Cost for Delivery Plus Cost per Book
Europe (Standard Air via Royal Mail)


Rest of World (Air Mail) £8.00 £6.00

In Stock items are sent same day (Monday to Friday before 3 pm) or within one working day.

Find out more in our full delivery and returns information

Related Products
Combinatorial Optimization: Algorithms and Complexity

Combinatorial Optimization: Algorithms and Complexity£24.99

Usually ships in 21 days  Usually ships in 21 days
Discrete Optimization Algorithms

Discrete Optimization Algorithms£22.99

Usually ships in 21 days  Usually ships in 21 days
Dynamic Optimization, Second Edition

Dynamic Optimization, Second Edition£20.99

  In stock, available today