Master your Minecraft
 
 

Special Offers see all

Enter to WIN a $100 Credit

Subscribe to PowellsBooks.news
for a chance to win.
Privacy Policy

Tour our stores


    Recently Viewed clear list


    Original Essays | November 7, 2014

    Carli Davidson: IMG Puppies for Sale? Read This First



    Shake Puppies contains an almost unsettling amount of cuteness. There is a good chance after looking through its pages you will get puppy fever and... Continue »

    spacer
Qualifying orders ship free.
$21.95
New Trade Paper
Ships in 1 to 3 days
Add to Wishlist
Available for In-store Pickup
in 7 to 12 days
Qty Store Section
2 Remote Warehouse Mathematics- Combinatorics
16 Remote Warehouse Mathematics- Combinatorics

More copies of this ISBN

This title in other editions

Combinatorial Optimization: Algorithms and Complexity

by

Combinatorial Optimization: Algorithms and Complexity Cover

 

Synopses & Reviews

Publisher Comments:

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.

Book News Annotation:

A text for a range of graduate courses, with some of the material suitable for students of computer science with a background in the theory of algorithms and some suitable for those with a background in operations research. Corrected and unabridged from the 1982 publication by Prentice-Hall, with a new preface.
Annotation c. Book News, Inc., Portland, OR (booknews.com)

Synopsis:

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.

Synopsis:

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.

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 problem

Synopsis:

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

Product Details

ISBN:
9780486402581
Author:
Papadimitriou, Christos H.
Author:
Steiglitz, Kenneth
Author:
Christos H. P
Author:
apadimitriou
Publisher:
Dover Publications
Location:
Mineola, N.Y. :
Subject:
Mathematical Analysis
Subject:
Machine Theory
Subject:
Mathematical optimization
Subject:
Combinatorics
Subject:
Computational complexity
Subject:
Combinatorial optimization
Subject:
General Mathematics
Subject:
Mathematics-Combinatorics
Edition Description:
Trade Paper
Series:
Dover Books on Computer Science
Publication Date:
19980131
Binding:
TRADE PAPER
Language:
English
Illustrations:
Yes
Pages:
528
Dimensions:
8.5 x 5.38 in 1.23 lb

Other books you might like

  1. Regular Polytopes 3RD Edition New Trade Paper $16.95
  2. Combinatorial Optimization: Networks... New Trade Paper $24.95
  3. Number Theory and Its History (Dover... Used Trade Paper $8.95
  4. The Beauty of Geometry: Twelve Essays Used Trade Paper $8.00
  5. Thirteen Books of the Elements... Used Trade Paper $8.00

Related Subjects

Arts and Entertainment » Art » General
Computers and Internet » Software Engineering » Algorithms
Reference » Science Reference » General
Science and Mathematics » Mathematics » Advanced
Science and Mathematics » Mathematics » Combinatorics
Science and Mathematics » Mathematics » General
Young Adult » General

Combinatorial Optimization: Algorithms and Complexity New Trade Paper
0 stars - 0 reviews
$21.95 In Stock
Product details 528 pages Dover Publications - English 9780486402581 Reviews:
"Synopsis" by ,
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.
"Synopsis" by ,
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.

"Synopsis" by , 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 problem
"Synopsis" by ,
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.
.

spacer
spacer
  • back to top

FOLLOW US ON...

     
Powell's City of Books is an independent bookstore in Portland, Oregon, that fills a whole city block with more than a million new, used, and out of print books. Shop those shelves — plus literally millions more books, DVDs, and gifts — here at Powells.com.