Mathematical Optimization
latest
Forward
Introduction
Facility location problems
Bin packing and cutting stock problems
Graph problems
Routing problems
Scheduling problems
Dynamic lot-sizing problems
Piecewise linear approximation of nonlinear functions
Multiple objective optimization
Second-order cone optimization
References
Mathematical Optimization
Docs
»
Index
Edit on GitHub
Index
Symbols
|
A
|
B
|
C
|
D
|
E
|
F
|
G
|
H
|
I
|
L
|
M
|
N
|
O
|
P
|
Q
|
R
|
S
|
T
|
U
|
V
|
W
Symbols
:math:`K-`\ coloring
:math:`K-`\ partition
:math:`k`-center problem
:math:`k`-cover problem
:math:`k`-median problem
A
activation cost
adjacent
arc
B
big M
bin packing problem
binary search
binary search tree
branch-and-bound
branch-and-bound tree
C
capacitated facility location
capacitated vehicle routing problem
chromatic number
color class
column
column generation
complementary graph
complete graph
connected component
connected graph
constraint
constraint programming
constraints
cover
cutting plane
,
[1]
cutting plane method
cutting stock problem
D
degree
dictionary
directed graph
dual problem
duality
duality gap
E
edge
F
facet-defining
facility location
FFD
first fit decreasing
formulation
formulation in mathematical optimization
G
generator
graph coloring problem
graph partitioning problem
graph problems
H
heuristics
I
incumbent solution
,
[1]
induced graph
integer optimization
,
[1]
L
left-hand side
lhs
line
linear expression
linear optimization problem
linear optimization relaxation
list comprehension
M
master problem
maximize
,
[1]
maximum clique problem
maximum flow problem
maximum stable set problem
min-max objective
minimize
,
[1]
minimum problem
mixed-integer optimization
model sense
multidict
N
node
non-negativity constraint
O
objective
objective function
,
[1]
opportunity cost
optimal solution
,
[1]
optimum
,
[1]
P
pattern
point
primal problem
Q
quicksum
R
reduced cost
rhs
right-hand side
routing problems
row
S
sensitivity analysis
,
[1]
sign restriction
slack variable
solution
strong formulation
sum
T
transportation problem
traveling salesman problem
TSP
TSP with time windows
TSP: cutset inequality
TSP: Dantzig-Fulkerson-Johnson formulation
TSP: Miller-Tucker-Zemlin formulation
TSP: multi-commodity flow formulation
TSP: potential formulation
TSP: separation problem
TSP: single-commodity flow formulation
TSP: subtour elimination formulation
TSP: subtour elimination inequality
tuple
U
uncapacitated facility location
,
[1]
,
[2]
undirected graph
V
valid inequality
variable
continuous variable; real variable
variables
vertex
vertices
W
weak formulation
Read the Docs
v: latest
Versions
latest
Downloads
pdf
htmlzip
epub
On Read the Docs
Project Home
Builds
Free document hosting provided by
Read the Docs
.