Combinatorial Optimization Book + PRICE WATCH * Amazon pricing is not included in price watch

Combinatorial Optimization 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 and concrete computational complexity in departments of computer science and mathematics.Read More

from£N/A | RRP: £39.47
* Excludes Voucher Code Discount Also available Used from £28.83
  • 0030848660
  • 9780030848667
  • Eugene Lawler
  • Harcourt College Pub
  • Hardcover (Book)
  • 384
As an Amazon Associate we earn from qualifying purchases. If you click through any of the links below and make a purchase we may earn a small commission (at no extra cost to you). Click here to learn more.

Would you like your name to appear with the review?

We will post your book review within a day or so as long as it meets our guidelines and terms and conditions. All reviews submitted become the licensed property of www.find-book.co.uk as written in our terms and conditions. None of your personal details will be passed on to any other third party.

All form fields are required.