August 2012
Intermediate to advanced
208 pages
4h 34m
English
This chapter describes basic problems posed by communication networks that can be tackled by linear programming. Formulations, solutions by GLPK, and related algorithms for various problems are presented in this chapter.
The network is represented by directed graph G(V, E), where V is the set of vertices (nodes) and E is the set of links. A link from node i to node j is expressed by
is the link cost of
where is the traffic volume from ...