20% off all books with the code: BOOKS
Olibro

My Cart

Loading...

Customer Login

Checkout as a new customer

Creating an account has many benefits:

  • See order and shipping status
  • Track order history
  • Check out faster
Create an Account
  • check 10+ million books
  • check New arrivals every day
  • check Trusted by 1M+ customers
  • check Great prices & discounts
  • check Shipping across Europe

Combinatorial Optimization: Algorithms and Complexity - Kenneth Steiglitz,Christos H. Papadimitriou

Kenneth Steiglitz, Christos H. Papadimitriou

(0)
Write a review
English
2000-02-01
€41.26 €51.57

-20% with code BOOKS

Softcover €51.57 Hardcover
In stock at our supplier

Shipping in 31-37 days

30-day return policy

Clearly written graduate-level text considers the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NP-complete problems, more. "Mathematicians wishing a self-contained introduction need look no further." - American Mathematical Monthly. 19 ... Full description

Description

Clearly written graduate-level text considers the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NP-complete problems, more. "Mathematicians wishing a self-contained introduction need look no further." - American Mathematical Monthly. 1982 edition.

More Information

Author Kenneth Steiglitz, Christos H. Papadimitriou
Publisher Dover Publications Inc.
Release year 2000
Cover type Softcover
EAN 9780486402581
Write Your Own Review
You're reviewing: Combinatorial Optimization: Algorithms and Complexity
Your Rating:

Goodreads Reviews

€41.26 €51.57