Combinatorial optimization : algorithms and complexity / Christos H. Papadimitriou, Kenneth Steiglitz.
Tipo de material:
TextoDetalles de publicación: Mineola, N.Y. : Dover Publications, ©1998.Edición: 1a ediciónDescripción: xvi, 496 páginas : ilustraciones ; 22 x 15 centímetrosTipo de contenido: - texto
- sin medio
- volumen
- 9780486402581 (pbk.)
- QA 402 .5 P21 1998
| Tipo de ítem | Biblioteca actual | Biblioteca de origen | Colección | Signatura topográfica | Copia número | Estado | Fecha de vencimiento | Código de barras | Reserva de ítems | |
|---|---|---|---|---|---|---|---|---|---|---|
Libros para consulta en sala
|
Biblioteca Antonio Enriquez Savignac | Biblioteca Antonio Enriquez Savignac | COLECCIÓN RESERVA | QA 402 .5 P21 1998 (Navegar estantería(Abre debajo)) | 1 | No para préstamo | 036964 |
Navegando Biblioteca Antonio Enriquez Savignac estanterías, Colección: COLECCIÓN RESERVA Cerrar el navegador de estanterías (Oculta el navegador de estanterías)
| No hay imagen de cubierta disponible | ||||||||
| QA402 S6518 Señales y Sistemas: Continuos y Discretos / | QA 402 .5 A72 2009 Algoritmos evolutivos : un enfoque práctico / | QA 402 .5 D2861 Multi-objective optimization using evolutionary algorithms / | QA 402 .5 P21 1998 Combinatorial optimization : algorithms and complexity / | QA 402 .5 S99 2006 Discrete optimization algorithms : with Pascal programs / | QA 402 .6 V44 The vehicle routing problem : latest advances and new challenges / | QA403 B75 The Fast fourier transform and its applications/ |
Originally published: Englewood Cliffs, N.J. : Prentice Hall, c1982. With new pref.
Incluye referencias bibliográficas: páginas 484-486 e índice
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 marching - Spanning trees and matroids - Integer linear programming - A cutting-plane algorithm for integer linear programs - NP-complete problems - More about NP-completeness - Approximation algorithms - Branch-and Bound and dynamic programming - Local search
" 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. "Mathematicians wishing a self-contained introduction need look no further." - American Mathematical Monthly." -- P. Web Editorial
PIT
NUEVOSTELEMAT
