These pages are editable by the community, so please contribute! Click here to learn more about this feature. We’d love to hear your feedback.
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... read more
List the books that contain additional information about this book.
If you have any suggestions for how we can improve this page or if there are sections that you would like us to add, please let us know.