Amazon cover image
Image from Amazon.com

Combinatorial optimization: algorithms and complexity Christos H. Papadimitriou

By: Contributor(s): Material type: TextTextPublication details: Englewood Cliffs, N.J. Prentice Hall 1982Description: xvi, 496 p. ill. 24 cmISBN:
  • 0131524623
Subject(s): DDC classification:
  • 519 P2C6
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 mastoids; 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"
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
Book Book Ahmedabad Non-fiction 519 P2C6 (Browse shelf(Opens below)) Available 184389
Total holds: 0

Includes bibliographical references and index.

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 mastoids; 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"

There are no comments on this title.

to post a comment.

Powered by Koha