ESI 5458 Optimization On Networks (3)

Prerequisite: ESI 3312. Review Of Basic Combinatorics. Basic Concepts Of Graph Theory. Matching And Covering, And Applications. Traversability And Path Problems On Networks, And Applications. Tree Problems. Network Flows And Applications. Eulerian Paths, Hamiltonian Paths, And Applications. Location Problems On Networks. Design Exercises.