Skip to Main Content
Linear Programming and Algorithms for Communication Networks
book

Linear Programming and Algorithms for Communication Networks

by Eiji Oki
August 2012
Intermediate to advanced content levelIntermediate to advanced
208 pages
4h 34m
English
CRC Press
Content preview from Linear Programming and Algorithms for Communication Networks

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

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Algorithms For Dummies

Algorithms For Dummies

John Paul Mueller, Luca Massaron

Publisher Resources

ISBN: 9781466552647