Network models /
Network models /
M.O. Ball, T.L. Magnanti; C.L. Monma y G.L. Nemhauser editores.
- Amsterdam : Elsevier Science, 1995.
- xii, 786 p.
Chapter 1. Applications of network optimization; Chapter 2. Primal simplex algorithms for minimum cost network flows; Chapter 3. Matching; Chapter 4. The traveling salesman problem; Chapter 5. Parallel computing in network optimization; Chapter 6. Probabilistic networks and network algorithms; Chapter 7. A survey of computational geometry; Chapter 8. Algorithmic implications of the graph minor theorem; Chapter 9. Optimal trees; Chapter 10. Design of survivable networkds; Chapter 11. Network reliability.
0444892923
INVESTIGACION DE OPERACIONES
ANALISIS DE REDES
OPTIMIZACION MATEMATICA
OPTIMIZACION COMBINATORIA
658.4032 / N474
Chapter 1. Applications of network optimization; Chapter 2. Primal simplex algorithms for minimum cost network flows; Chapter 3. Matching; Chapter 4. The traveling salesman problem; Chapter 5. Parallel computing in network optimization; Chapter 6. Probabilistic networks and network algorithms; Chapter 7. A survey of computational geometry; Chapter 8. Algorithmic implications of the graph minor theorem; Chapter 9. Optimal trees; Chapter 10. Design of survivable networkds; Chapter 11. Network reliability.
0444892923
INVESTIGACION DE OPERACIONES
ANALISIS DE REDES
OPTIMIZACION MATEMATICA
OPTIMIZACION COMBINATORIA
658.4032 / N474