Copyright ©1998-2010 Glenn Fleishman. Send in your comments. Bibliographic information on isbn.nu licensed from Baker & Taylor. Contact them for corrections and licensing, or read more about our data.
Combinatorial Optimization: Algorithms and Complexity
Descriptions of each edition are found in brief where available. Click details & prices to get more information on a book or to find the best prices for the title.
Hardcover
from Prentice Hall (September 1, 1981)
9780131524620 | details & prices | List price $78.00
About: Clearly written graduate-level text considers 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.
About: Clearly written graduate-level text considers 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.
Paperback
With Kenneth Steiglitz |
Unabridged edition from Dover Pubns (January 29, 1998)
9780486402581 | details & prices | 496 pages | 5.50 × 8.50 × 1.25 in. | 1.20 lbs | List price $21.95
About: Clearly written graduate-level text considers 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.
About: Clearly written graduate-level text considers 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.