O'Reilly logo

Linear Programming and Algorithms for Communication Networks by Eiji Oki

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

Chapter 4

Basic problems for communication networks

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.

4.1 Shortest path problem

4.1.1 Linear programming problem

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 ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required