Cargando…
Combinatorial optimization: algorithms and complexity
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 proble...
| Autores principales: | , |
|---|---|
| Lenguaje: | eng |
| Publicado: |
Dover
1998
|
| Materias: | |
| Acceso en línea: | http://cds.cern.ch/record/453497 |
| _version_ | 1780896205053624320 |
|---|---|
| author | Papadimitriou, Christos H Steiglitz, Kenneth |
| author_facet | Papadimitriou, Christos H Steiglitz, Kenneth |
| author_sort | Papadimitriou, Christos H |
| collection | CERN |
| description | 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, and electrical engineering. |
| id | cern-453497 |
| institution | Organización Europea para la Investigación Nuclear |
| language | eng |
| publishDate | 1998 |
| publisher | Dover |
| record_format | invenio |
| spelling | cern-4534972021-04-22T02:59:26Zhttp://cds.cern.ch/record/453497engPapadimitriou, Christos HSteiglitz, KennethCombinatorial optimization: algorithms and complexityMathematical Physics and MathematicsThis 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, and electrical engineering.Doveroai:cds.cern.ch:4534971998 |
| spellingShingle | Mathematical Physics and Mathematics Papadimitriou, Christos H Steiglitz, Kenneth Combinatorial optimization: algorithms and complexity |
| title | Combinatorial optimization: algorithms and complexity |
| title_full | Combinatorial optimization: algorithms and complexity |
| title_fullStr | Combinatorial optimization: algorithms and complexity |
| title_full_unstemmed | Combinatorial optimization: algorithms and complexity |
| title_short | Combinatorial optimization: algorithms and complexity |
| title_sort | combinatorial optimization: algorithms and complexity |
| topic | Mathematical Physics and Mathematics |
| url | http://cds.cern.ch/record/453497 |
| work_keys_str_mv | AT papadimitriouchristosh combinatorialoptimizationalgorithmsandcomplexity AT steiglitzkenneth combinatorialoptimizationalgorithmsandcomplexity |