Index

addition principle, 159, 163

adjacency, 174

aggregated node-link formulation (AG), 635

algorithm for minimal spanning tree, 184

aliasing, 13

AM, 12

aperiodic, see period, aperiodic

approximation, 8

Arrow, 725, 726

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

Get Mathematical Foundations for Signal Processing, Communications, and Networking now with O’Reilly online learning.

O’Reilly members experience live online training, plus books, videos, and digital content from 200+ publishers.