cover image

Combinatorial optimization : algorithms and complexity / Christos H. Papadimitriou, Kenneth Steiglitz.

; Steiglitz, Kenneth, 1939-
Englewood Cliffs, N.J. : Prentice Hall, [1982] .
ISBN 9780486402581, 0486402584, 0131524623, 9780131524620

Location Call Number Status Consortium Loan
George Washington
Gelman stacks
QA 402.5 .P37 (show me on map) Available Request
American
LIB stacks
QA402.5 .P37 Available Request
Catholic
Mullen Library stacks
QA402.5 .P37 Available Request
George Mason
Fenwick stacks
QA402.5 .P37 Available Request
Howard
Founders Library stacks
QA402.5 P37 Available Request
Other Authors Steiglitz, Kenneth, 1939-
Subjects Analyse combinatoire.
Combinatorial optimization.
Complexité de calcul (Informatique)
Complexité de calcul (informatique)
Computational complexity.
Kombinatorik.
Kombinatorische Optimierung.
Mathematical optimization.
Optimierung.
Optimisation combinatoire.
Optimisation mathématique.
algorithme approximation.
algorithme simplexe.
analyse combinatoire.
complexité calcul.
dualité
matroïde.
optimisation mathématique.
programmation dynamique.
programmation linéaire.
Description xvi, 496 pages : illustrations ; 24 cm
Copyright Date [1982]
©1982
Notes Includes bibliographical references and index.
Also issued online.
Summary Christos H. Papadimitriou and Kenneth Steiglitz have combined the theory of computational complexity developed by computer scientists, and the foundations of mathematical programming developed by the operations research community. This text will be useful to students with a wide range of backgrounds, including computer science, operations research, and electrical engineering.
Contents Optimization problems -- The simplex algorithm -- Duality -- computational considerations for the simplex algorithm -- The primal-dual algorithm -- Primal-dual algorithms for max-flow and shortest path: Ford-Fulkerson and Dijkstra -- Primal-dual algorithms for min-cost flow -- Algorithms and complexity -- Efficient algorithms for the max-flow problem -- Algorithms for matching -- Weighted matching -- Spanning trees and matroids -- Integer linear programming -- A cutting-lane algorithm for integer linear programs -- NP-complete problems -- More about NP-completeness -- Approximation algorithms -- Branch-and-bound and dynamic programming -- Local search.
Network Numbers (OCoLC)7463296
(OCoLC)ocm07463296
WorldCat Search OCLC WorldCat
WorldCat Identities Papadimitriou, Christos H.
Publication timeline, list of works, related names and subjects and other information

Services

Export citation to: RefWorks