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 |