000 01582nam a2200373 4500
001 24333
005 20250702091520.0
008 070731s1995 ne 000 0 eng d
020 _a0444892923
040 _aclsautm
041 0 _aeng
044 _ane
082 0 4 _a658.4032
_bN474
245 0 0 _aNetwork models /
_cM.O. Ball, T.L. Magnanti; C.L. Monma y G.L. Nemhauser editores.
260 _aAmsterdam :
_bElsevier Science,
_c1995.
300 _axii, 786 p.
505 0 _aChapter 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.
650 1 7 _aINVESTIGACION DE OPERACIONES
_2
_9384
650 1 7 _aANALISIS DE REDES
_961157
650 1 0 _aOPTIMIZACION MATEMATICA
_932110
650 1 7 _aOPTIMIZACION COMBINATORIA
_961145
700 1 _aMagnanti, T. L.
_95467
700 1 _aKennington, J. L.
_95468
700 1 _aGerards, A. M. H.
_95469
700 1 _aSnyder, T. L.
_95470
700 1 _aMitchell, J. S. B.
_95471
700 1 _aLangston, M. A.
_95472
700 1 _aMagnanti, T. L.
_95467
700 1 _aMonma, C. L.
_95473
700 1 _aBalol, M. O.
_95474
904 _aRosana
905 _aEDUTEM
907 _aGriselda
999 _c24333
_d24333