News Help Institutional access
Back to results
Bibliographic record · Consultation and access
Artículo

Combinatorial Optimization: Algorithms and Complexity.

David Johnson; Christos H. Papadimitriou; Kenneth Steiglitz · American Mathematical Monthly · 1984

Supplementary material available
Quick overview. Review the resource’s basic details, then access the content using the main button. This page shows only the information needed to identify, cite, and open the work.
Author / responsible party
David Johnson; Christos H. Papadimitriou; Kenneth Steiglitz
Publisher
American Mathematical Monthly
Year
1984
Language
English

Resource access

Open the content from the main option or choose another available source.

OpenAlex OpenAlex Works
Entrar por OpenAlex
Main access

Supplementary material available

El enlace apunta a material asociado, anexos, tablas, datos o página complementaria. No se marca como libro/texto completo.
Open material

Summary

Descripción general del contenido del recurso.

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.

How to cite

Elegí el formato que necesitás y copiá la referencia al portapapeles.

APA 7

Johnson, D, Papadimitriou, C. H, & Steiglitz, K. (1984). Combinatorial Optimization: Algorithms and Complexity. https://doi.org/10.2307/2322374

MLA

Johnson, David, et al. "Combinatorial Optimization: Algorithms and Complexity." 1984. https://doi.org/10.2307/2322374.

Chicago

Johnson, David, Christos H. Papadimitriou, and Kenneth Steiglitz. 1984. "Combinatorial Optimization: Algorithms and Complexity.". https://doi.org/10.2307/2322374.

Harvard

Johnson, D, Papadimitriou, C. H. and Steiglitz, K. 1984, Combinatorial Optimization: Algorithms and Complexity, American Mathematical Monthly, available at: https://doi.org/10.2307/2322374 [Accessed 7 Aug. 2026].

Share and print

Save the record, copy its permanent link, or print it as a PDF.

Export reference

You can export the record in common formats for use in a reference manager.

RIS BibTeX

Resource details

Bibliographic information to help confirm that this is the correct material.

Title
Combinatorial Optimization: Algorithms and Complexity.
Author / contributors
David Johnson; Christos H. Papadimitriou; Kenneth Steiglitz
Publisher
American Mathematical Monthly
Publication year
1984
Language
English

Subjects

Explore related resources through these subjects.

Simplex algorithm; Heuristics; Matroid; Computer science; Linear programming; Exposition (narrative); Matching (statistics); Algorithm; Constructive; Flow network; Combinatorial optimization; Ellipsoid method
Copied