Skip to content

Combinatorial Optimization: Algorithms and Complexity.

Christos H. Papadimitriou, Kenneth Steiglitz

American Mathematical Monthly · 1984 · 5,982 citations

No retraction on record in OpenAlex.Check Crossref now

Cite this paper

Johnson, D. S., Papadimitriou, C. H., & Steiglitz, K. (1984). Combinatorial optimization: Algorithms and complexity. American Mathematical Monthly, 91(3), 209. https://doi.org/10.2307/2322374

In text: (Johnson et al., 1984)

Ask a question about this research

One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.

Abstract

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 NPcomplete problems, more. All chapters are supplemented by thoughtprovoking 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. 1982 ed.

  1. The quickhull algorithm for convex hulls1996
  2. Integer and Combinatorial Optimization1990
  3. Voronoi diagrams—a survey of a fundamental geometric data structure1991
  4. The Nucleolus of a Characteristic Function Game1969

Metadata from OpenAlex (CC0). Citations are generated from the published record.