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. "Mathematicians wishing a self-contained introduction need look no further." — American Mathematical Monthly. 1982 edition.
ArbetstitelCombinatorial optimization - algorithms and complexity
Standardpris399.00
Illustrerad
Orginaltitel
Åldersgrupp
BandtypHäftad
Recensionsutdrag
Läsordning i serie
MediatypBok
AvailableToOrder
IsContractProduct Inlaga
Sidor528
Publiceringsdatum1998-01-29 00:00:00
FörfattareKenneth Steiglitz
erpOwnsPrice Kort BeskrivningClearly 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. "Mathematicians wishing a self-contained introduction need look no further." — American Mathematical M
Storlek
Färg
IsBokinfoProduct SeriesTitle
BokinfoStatusCode22