![]() Combinatorial Optimization
ISBN: 978-0-471-55894-1
Hardcover
368 pages
November 1997
US $173.00
This price is valid for United States. Change location to view local pricing and availability. This is a Print-on-Demand title. It will be printed specifically to fill your order. Please allow an additional 5-6 days delivery time. The book is not returnable.
|
An online version of this product is available through our subscription-based content service. Visit Wiley Online Library now |
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.




Share This