Combinatorial optimization: algorithms and complexity

By:

Papadimitriou, Christos H

Contributor(s):

Steiglitz, Kenneth

Material type: Text

TextPublication details: Dover Publication, Inc. New York 1998Description: xvi, 496 pISBN:

9780486402581

Subject(s):

DDC classification:

511.6 PAP

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

List(s) this item appears in: Operation & quantitative Techniques | Hindi Books

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Collection	Call number	Copy number	Status	Date due	Barcode
Book	Indian Institute of Management LRC General Stacks	Operations Management & Quantitative Techniques	511.6 PAP (Browse shelf(Opens below))	1	Available		001430

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.

There are no comments on this title.

to post a comment.