![]() |
![]() |
Your cart is empty |
||
Showing 1 - 2 of 2 matches in All Departments
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.
|
![]() ![]() You may like...
Terminator 6: Dark Fate
Linda Hamilton, Arnold Schwarzenegger
Blu-ray disc
![]() R79 Discovery Miles 790
Positively Me - Daring To Live And Love…
Nozibele Mayaba, Sue Nyathi
Paperback
![]()
|