Combinatorial OptimizationISBN: 978-0-471-55894-1
Hardcover
368 pages
November 1997
 This is a Print-on-Demand title. It will be printed specifically to fill your order. Please allow an additional 10-15 days delivery time. The book is not returnable.
|
||||||
Problems and Algorithms.
Optimal Trees and Paths.
Maximum Flow Problems.
Minimum-Cost Flow Problems.
Optimal Matchings.
Integrality of Polyhedra.
The Traveling Salesman Problem.
Matroids.
NP and NP-Completeness.
Appendix.
Bibliography.
Index.
Optimal Trees and Paths.
Maximum Flow Problems.
Minimum-Cost Flow Problems.
Optimal Matchings.
Integrality of Polyhedra.
The Traveling Salesman Problem.
Matroids.
NP and NP-Completeness.
Appendix.
Bibliography.
Index.
Related Titles
More From This Series
More By These Authors
Read Online Now at Wiley Online Library
An online version of this product is available through our
subscription-based content service.
Read Online
View the Series
.png){kind=small}
Join An E-mail ListLearn about the latest products, events, offers and content. |
