Un testo di livello universitario scritto in modo chiaro prende in considerazione l'algoritmo ellissoidale sovietico per la programmazione lineare; algoritmi efficienti per flusso di rete, matching, spanning tree e matroidi; la teoria dei problemi NP completi; algoritmi di approssimazione, euristiche di ricerca locale per problemi NP completi e altro ancora. I matematici che desiderano un'introduzione autosufficiente non hanno bisogno di cercare oltre. American Mathematical Monthly. Edizione del 1982.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Book by Papadimitriou Christos H Steiglitz Kenneth
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Da: ThriftBooks-Atlanta, AUSTELL, GA, U.S.A.
Paperback. Condizione: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less. Codice articolo G0486402584I3N00
Quantità: 1 disponibili
Da: World of Books (was SecondSale), Montgomery, IL, U.S.A.
Paperback. Condizione: Very Good. 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. Codice articolo 00108775634
Quantità: 1 disponibili
Da: World of Books (was SecondSale), Montgomery, IL, U.S.A.
Paperback. Condizione: Fair. 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. Codice articolo CIN0486402584A
Quantità: 1 disponibili
Da: Better World Books, Mishawaka, IN, U.S.A.
Condizione: Good. Former library copy. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good. Codice articolo 7553964-6
Quantità: 1 disponibili
Da: Better World Books, Mishawaka, IN, U.S.A.
Condizione: Very Good. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good. Codice articolo 12013634-6
Quantità: 1 disponibili
Da: Better World Books, Mishawaka, IN, U.S.A.
Condizione: Good. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good. Codice articolo 4338829-6
Quantità: 3 disponibili
Da: Better World Books: West, Reno, NV, U.S.A.
Condizione: Very Good. Former library copy. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good. Codice articolo GRP65476343
Quantità: 1 disponibili
Da: Books Liquidation, Sacramento, CA, U.S.A.
paperback. Condizione: Good. Codice articolo mon0000028070
Quantità: 1 disponibili
Da: World of Books Inc, Montgomery, IL, U.S.A.
Paperback. Condizione: Fair. 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. Codice articolo CIN0486402584A
Quantità: 1 disponibili
Da: World of Books Inc, Montgomery, IL, U.S.A.
Paperback. Condizione: Very Good. 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. Codice articolo CIN0486402584VG
Quantità: 1 disponibili