Buy Combinatorial Optimization - (Dover Books on Computer Science) by Christos H Papadimitriou & Kenneth Steiglitz (Paperback) in United States - Cartnear.com

Combinatorial Optimization - (Dover Books on Computer Science) by Christos H Papadimitriou & Kenneth Steiglitz (Paperback)

CTNR803315 09780486402581 CTNR803315

Alfred

Alfred
2023-12-08 USD 17.94

$ 17.94 $ 18.69

Item Added to Cart

*Product availability is subject to suppliers inventory

Combinatorial Optimization - (Dover Books on Computer Science) by  Christos H Papadimitriou & Kenneth Steiglitz (Paperback)
SHIPPING ALL OVER UNITED STATES
Combinatorial Optimization - (Dover Books on Computer Science) by  Christos H Papadimitriou & Kenneth Steiglitz (Paperback)
100% MONEY BACK GUARANTEE
Combinatorial Optimization - (Dover Books on Computer Science) by  Christos H Papadimitriou & Kenneth Steiglitz (Paperback)
EASY 30 DAYSRETURNS & REFUNDS
Combinatorial Optimization - (Dover Books on Computer Science) by  Christos H Papadimitriou & Kenneth Steiglitz (Paperback)
24/7 CUSTOMER SUPPORT
Combinatorial Optimization - (Dover Books on Computer Science) by  Christos H Papadimitriou & Kenneth Steiglitz (Paperback)
TRUSTED AND SAFE WEBSITE
Combinatorial Optimization - (Dover Books on Computer Science) by  Christos H Papadimitriou & Kenneth Steiglitz (Paperback)
100% SECURE CHECKOUT
Number of Pages: 528
Genre: Mathematics
Sub-Genre: Combinatorics
Series Title: Dover Books on Computer Science
Format: Paperback
Publisher: Dover Publications
Age Range: Adult
Author: Christos H Papadimitriou & Kenneth Steiglitz
Language: English



About the Book



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.



Book Synopsis



This clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses 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. All chapters are supplemented by thought-provoking problems. A useful work for graduate-level students with backgrounds in computer science, operations research, and electrical engineering. Mathematicians wishing a self-contained introduction need look no further. -- American Mathematical Monthly.

Related Products

See More

You May Also Like

See More