Index
a modeling language for
mathematical
programming (AMPL), 25
Bellman-Ford algorithm, 43
boundary, 11
canonical form, 8, 9
combinatorial number-placement puzzle, 145
communication network, 1, 31
constraint, 6
corner point, 11
crossconnect, 93
cycle-canceling algorithm, 59
Dantzig, 14
decision variable, 6
Dijkstra’s algorithm, 40
directed graph, 1, 31, 45, 54, 66, 73, 78, 81, 103, 132
disjoint path, 65
disjoint shortest pair algorithm, 69
dogs and chicks problem, 149
dual problem, 18, 19
dual theorem, 20, 106, 111, 115
feasible region, 11
feasible solution, 5
Ford-Fulkerson algorithm, 50
glpsol, 26
GNU linear programming kit (GLPK), 25
graph coloring problem, 96
HLT model, 113
hose model, 105
hose model with bounds of link
traffic volume, ...
Get Linear Programming and Algorithms for Communication Networks now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
