BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science)

Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science)

Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer
Stock photo: cover may vary

Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science) Paperback - 1998

by Papadimitriou, Christos H.,Steiglitz, Kenneth

Add to wish list
  • Used
  • Good
  • Paperback
Used - Good

Description

Dover Publications, 1/29/1998 12:00:01 A. paperback. Good. 1.0000 in x 8.4000 in x 5.3000 in.
Ask the seller a question Add to wish list
A$3.85
A$5.78 Delivery within USA
Standard delivery: 2 to 8 days
More delivery options
Ships from Evergreen Goodwill (Washington, United States)

Details

About Evergreen Goodwill Washington, United States

Biblio member since 2025

Evergreen Goodwill helps people get jobs across Northwest Washington by offering high-quality free job training, education and job placement..

Terms of Sale:

30 day return guarantee, with full refund including original shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from Evergreen Goodwill

Reader reviews for Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science)

From the publisher

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.
tracking-