HOME | BESTSELLERS | NEW RELEASES | PRICE WATCH | FICTION | BIOGRAPHIES | E-BOOKS |
+ PRICE WATCH
* Amazon pricing is not included in price watch
Combinatorial Optimization: Algorithms and Complexity Book
This clearly written , mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses 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. All chapters are supplemented by thought-provoking problems. A useful work for graduate-level students with backgrounds in computer science, operations research, and electrical engineering. "Mathematicians wishing a self-contained introduction need look no further."—American Mathematical Monthly. 1982 ed.Read More
from£40.99 | RRP: * Excludes Voucher Code Discount Also available Used from £22.35
- 0131524623
- 9780131524620
- Christos H. Papadimitriou, Kenneth Steiglitz
- 1 January 1982
- Prentice Hall
- Hardcover (Book)
- 496
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.