adjacency, 174
aggregated node-link formulation (AG), 635
algorithm for minimal spanning tree, 184
aliasing, 13
AM, 12
aperiodic, see period, aperiodic
approximation, 8
average, 7
balance, 193
balanced incomplete block design, 191
Bruck-Chowla-Ryser Theorem, 194
covalency, 193
Fisher’s inequality, 194
incidence matrix, 194
simple, 194
baseband, 13
Bayesian equilibrium, 709
Benders decomposition (BD), 645
Benders decomposition algorithm, 645
Bessel equality, 11
bifurcated routing, 636
bijection, 5
binary program (BP), 648
binary relation, 174
Binet’s formula, 173
bipartite, 175
bipartite graph, 175
bisection method, 133
block, 192
repeated, 194
block design, 192
balance, 193
covalency, 193
frequency, 192
incidence matrix, 194
replication number, 192
simple, 194
treatment, 192
variety, 192
bounded, 7
branch-and-bound (BB), 650, 651
branch-and-bound algorithm, 652
branch-and-cut algorithm, 659
branch-and-price (BP), 660
branch-and-price-and-cut (BPC), 662
Bruck-Chowla-Ryser Theorem, 194
cancellation, 119
Central Limit Theorem, 226
characteristic equation, 171
check digit, 186
Chernoff bound, 221
Chernoff’s information, 312
chopping, 123
Clarke, 726
Venn diagram, 186
codeword, 186
combination, 160
combinatorial optimization, 662
compact formulation, 633
complement, 175
complement of graph, 175
complete bipartite graph, 175
complete graph, 175
Concentration inequalities, 295
condition
Dirichlet, see Dirichlet, conditions
necessary, 7
sufficient, 7
condition number, 120
continuous, 5
piecewise, 16
convergence, 7
convex hull, 648
core, 719
correspondence, 5
transform, see transform, cosine
Cournot, 709
covalency, 193
Cramér’s theorem, 301
cubic graph, 176
Cumulant generating function, 298
cumulative distribution function, 209
cut, 650
cut-and-branch (CB), 658
cutting plane, 650
cutting plane algorithm, 651
d’Aspremont, 726
data compression, 14
dc component, 7
de Morgan’s Laws, 165
Decision rule, see also Test
decoding, 185
degree, 176
δ (·), 12
demands, 628
deterministic, 5
difference, 10
second-order, 15
digraph, 175
dimensioning function, 640
dimensioning problem (DP), 638, 681
Dirac, 12
delta, see δ (·)
Dirac delta, 10
directed graph, 175
Dirichlet, 6
domain, 5
time, 5
dynamic routing, 680
eigenvalues
deflation, 147
inverse iteration, 142
orthogonal iteration, 144
power method, 141
encoding, 185
energy, 7
Entropy, 305
Bessel, see Bessel, equality
Parseval, see Parseval, equality
error
absolute, 117
backward, 121
computational, 117
data, 117
relative, 117
unit roundoff, 123
Euler’s Theorem, 179
eulerian, 179
evolutionary algorithm (EA), 663
evolutionary stable strategy, 716
existence, 7
Expected value, 217
extrapolation, 125
extrema, 7
failure state, failure scenario, 629
feasibility pump (FP), 663
feasibility test (FT), 645
Fibonacci number, 172
filter
low-pass
ideal, 13
energy, 7
support, 8
Fisher’s inequality, 194
fixed-charge problem, 654
flow allocation problem (FAP), 632. 681
flow pattern, 632
Folk-theorem, 716
formal power series, 167
Fourier, 5
Fourier’s Theorem, 6
integral, 9
representation, 8
expansion, 9
convolution, 11
differentiation, 10
duality, 10
integral, 9
integration, 10
inverse, 9
modulation, 11
pair, 9
shifting, 10
domain, 11
response, 11
function, 5
bandlimited, 13
continuous
piecewise, 16
Dirac delta, 12
discontinuous, 7
even, 6
odd, 6
periodic, 6
sampling, 12
game
Bayesian, 708
characteristic form, 718
coalitional, 718
extensive form, 710
minimax solution, 697
multistage, 710
non-zero-sum, 699
normal form, 694
player
type, 708
repeated, 715
strategy, 694
value, 697
zero sum, 696
Gaussian, 212
generating function, 167
geometric series, 168
Gerard-Varet, 726
Gibbs, 8
phenomenon, 8
graecolatin square, 190
circuit, 177
closed walk, 177
component, 178
connectedness, 178
edge, 174
hamiltonian, 180
simple walk, 177
vertex, 174
Groves, 726
harmonic, 8
analyzer, 8
Harsanyi, 708
hidden Markov model, 236
hop-limit, 636
hot-standby (HS), 669
Hurwicz, 724
Hypothesis testing, 310
Icosian game, 179
response, 11
train, 12
incentive-compatible mechanism, 727
incidence, 192
incidence matrix, 194
independence, 208
Inequalities
Chebyshev, 296
Chernoff, 297
Markov, 296
infinity, 9
information set, 713
integer program (IP), 648
integrable
absolute, 16
absolutely, 7
integral, 9
Fourier, see Fourier, integral
integrality property, 653
bandlimited, 13
cubic splines, 131
Lagrange, 127
Newton, 128
splines, 131
inverse cosine transform, see transform, cosine
inverse Fourier transform, see Fourier, transform
isolated vertex, 176
Kolmogorov axioms, 206
Kullback-Leibler distance, see also Relative entropy
Lagrangean relaxation, 653
Lagrangean subproblems, 653
Large deviations, 295
Latin square, 191
mutually orthogonal, 190
order, 188
self-orthogonal, 201
side, 188
standardized, 190
law of large numbers, 226
Legendre transform, 298
limit, 7
LTI, 11
scale, 6
linear programming (LP), 633, 642, 698
linear relaxation (LP relaxation), 648
link diversity, 636
link protection (LPR), 679
link-flow, 632
link-path formulation (L-P), 632
Lucas, Edouard, 174
numbers, 174
machine precision, 123
Marčenko-Pastur law, 250
Markov inequality, 220
Markov process, 232
Maskin, 724
master problem of BD, 645
matrix
incidence, 194
mean, 7
meta-heuristics, 662
Michelson
Albert, 8
mixed-binary program (MBP), 648
mixed-integer program, 681
mixed-integer program (MIP), 637, 640, 642, 647
modular dimensioning problem (MDP), 639
modulation, 11
amplitude, 12
most violated cut, 657
Muller’s method, 139
multicommodity flow network (MFN), 628
multifacility dimensioning, 640
multihour design, 680
multiperiod design, 681
multiple edges, 174
multiplication principle, 159
mutually exclusive, 206
Myerson, 724
Nash, 700
Nash bargaining, 702
Nash equilibrium, 700
neighbor, 174
network, 174
network design problem (NDP), 628
network graph, 628
network survivability, 665
Newton’s method, 136
Neyman-Pearson lemma, 310
Neyman-Pearson test
SIMO, 276
node-link formulation (N-L), 633
noise, 185
nonbifurcated routing, 636
noncompact formulation, 633
nucleolus, 721
null graph, 175
numbers
complex, 10
imaginary part, 10
real part, 10
real, 10
oblivious routing, 680
one-facility dimensioning, 640
order of convergence, 137
overflow, 122
overshoot, 8
Pareto boundary, 695
Parseval, 11
equality, 11
path generation (PG), 643
path generation algorithm, 644
path-flow, 632
fundamental, 6
bounded, see bounded
periodicity, 6
permutation, 160
polyhedral separation problem, 657
preference relation, 692
Prim’s algorithm, 184
principle of inclusion and exclusion, 165
prisoner’s dilemma, 699
probability density function, 211
probability mass function, 209
proper subgraph, 175
protection mechanisms, 665
Random process, 227
random variable, 208
randomized rounding, 664
Rate function, 298
real
sequence, 14
degree, 170
homogeneous, 170
linear, 170
reflection, 6
regular graph, 176
Relative entropy, 305
repeated block, 194
replication number, 192
restoration mechanisms, 670
restricted reconfiguration (RR), 672
rounding, 123
rule of sum, 163
sampling, 12
impulse-train, 12
sample, 12
Sanov’s theorem, 308
linear, see linear
Schmeidler, 721
secant method, 138
self-orthogonal Latin square, 201
sensitivity, 120
separation step, 656
sequence
real, 14
series, 6
expansion, 7
Fourier, see Fourier, series, 7, 9
Shannon transform, 252
Shapley, 719
Shapley value, 721
shared risk link group (SRLG), 630, 668
shortest-path allocation rule (SPA), 639
aperiodic, 9
continuous
time, 12
discrete
time, 12
energy
finite, 7
periodic, 9
time, 8
similarity transformation, 145
simple design, 194
simulated allocation (SAL), 663
simulated annealing (SAN), 663
transform, see transform, sine
single-path routing, 636
singular values, 152
singular value decomposition, 151
left singular vector, 152
right singular vector, 152
social choice function, 724
leakage, see spectrum, leakage
spectral growth, see spectrum, growth
spectrum, 13
growth, 8
leakage, 8
star, 175
static routing, 680
Stationary process, 228
Stein’s lemma, 313
stub-release, 672
subgame-perfect equilibrium, 712
subgradient maximization, 653
subgraph, 175
sum
partial, 7
summation, 9
synthesis, see Fourier, Fourier’s Theorem
tabu search (TS), 663
Test, 310
Bayesian test, 313
likelihood ratio test, 310
minimum error probability test, 313
Neyman-Pearson test, 310
time
domain, 11
time reversal, 6
topological design problem, 654
totally unimodular, 649
traffic uncertainty, 680
continuous, 5
cosine, 14
inverse, 14
operator, 14
discrete, 5
Karhunen–Loéve, 5
kernel, see kernel
sine, 14
inverse, 16
operator, 16
time-frequency, 5
transform domain, 5
Traveling Salesman Problem, 181–182
treatment, 192
Prim’s algorithm, 184
spanning tree, 185
trigger strategy, 716
truncation, 8
Type, 304
type class, 305
underflow, 122
undershoot, 8
unrestricted reconfiguration (UR), 670
unsplittable flow, 636
utility theory, 692
valency, 176
variable, 6
independent, 6
variety, 192
Venn diagram, 163
vertex, 174
Vickrey, 725
closed, 177
simple, 177
wheel, 197
zeros of polynomials deflation, 140