Combinatorial optimization : algorithms and complexity

By:

Papadimitriou, Christos H

Material type: Text

TextPublication details: New York Dover Publications, inc. 1998Description: 496pISBN:

9780486402581 (pbk.)

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

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	Status	Date due	Barcode
Book	Plaksha University Library	Mathematics	511.6 PAP (Browse shelf(Opens below))	Available		002557

Browsing Plaksha University Library shelves, Collection: Mathematics Close shelf browser (Hides shelf browser)

Previous								Next
Previous	511.6 KOL Discrete mathematical structures	511.6 MAN Commutation relations, normal ordering, and stirling numbers	511.6 PAD Linear optimization and extensions	511.6 PAP Combinatorial optimization : algorithms and complexity	511.6 ROB Applied combinatorics	511.6 STA Algebraic combinatorics : walks, trees, tableaux, and more	511.6 TRE Discrete mathematical structures with applications to computer ccience	Next

https://store.doverpublications.com/0486402584.html

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

There are no comments on this title.

to post a comment.