Beschrijving
This 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; local search heuristics for NP-complete problems, more. 1982 edition.
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.
Populaire zoekopdrachten
Snel naar
Trending now

How to Build a Car: The Autobiography of the World’s Greatest Formula 1 Designer
Newey, Adrian

The Science of Animals: Inside their Secret World
DK || Chris Packham

The Rolling Stones All the Songs Expanded Edition: The Story Behind Every Track
Jean-Michel Guesdon || Philippe Margotin

Ride: Cycle the World
DK Travel
Aanbevolen

M. Garand
€ 20,70

Danièle Bott
€ 32,40

Hachisu, Nancy Singleton
€ 40,50

Jean-Michel Guesdon || Philippe Margotin
€ 40,50

Collins Maps
€ 34,20

DK Travel
€ 20,70

DK || Chris Packham
€ 28,80

Sarah J. Maas
€ 18,00

Newey, Adrian
€ 32,88

DK || Chris Packham
€ 33,10
Serie & gerelateerd