A
anti-Horn
a priori optimization
a priori solution
acyclic permutation
affine
algorithm
approximation
based on 2-matching and matching
based on the spanning tree
based on the spanning tree and matching
best insertion
best partial tour
branch-and-bound
branch-and-cut
competitive
constructive
dynamic programming
exact
greedy
list
list update
minimax algorithms
nearest neighbor
on-line
2-opt
polynomial
polynomial approximation scheme
pseudo-polynomial
separation
algorithmic geometry
approximate tour
val(T)
approximation schemes
classical
differential
APX
APX-complete
assignment
balanced
assignment problem
availability
B, C
bijunctive
bipartition
Boolean variable
branch-and-bound
evaluation
pruning
strategy
chess programs
chromatic number
bounded
interval
list
mixed
T- 290
chromatic scheduling
chromatographic number
class
NP
P
PLS
clause
closing
coalition
coloring
probabilistic
combinatorial optimization problem
competitive ratio
complete approximation scheme
classical
differential
complexity
linear
pseudo-polynomial
concave function
congestion
model
constraint propagation
convex envelope
convex function
convex set
convexification
counting problem
covering (problem)
cumulative constraint
cuts
cone
D, E
DAPX
decidability
decision trees
deepest descent
DFPTAS
differential ratio
discrete scenario model
distance
dominance
dominated paths
DPTAS
dual approximate solution
due date
dynamic programming
dominance
edge coloring
edge finding
efficiency value
eigenvalue
energetic reasoning
equilibrium
ε-approximate Nash
mixed Nash
Nash
polynomial
pure Nash
strong
Eulerian graph
evaluative inverse problem
even bipartition
EWGLA
exact methods
2-exchange
exhaustive search
EXPP
Exp-APX
Exp-DAPX
exploration
hybrid
implicit
tree search
facet
facility location
feasible solution
finite improvement property
first descent
fixed point
flow
F, G, H
FNP
FPTAS
function
potential
functional
games
concave
congestion
cooperative
coordination
defined on a graph
exact potential
fictive
isomorphism
mixed extension
network congestion
non-cooperative
ordinal potential
potential
quasi-concave
symmetric with two players
theory
transformation
weighted potential
zero sum two player
glass
spin
global constraints
graph
neighborhood
transition
coloring
coloring extension
Hamiltonian cycle
hard capacities (problem with)
heuristics
greedy
Lagrangian
local search
hierarchical optimality
hub (problem with)
hybrid method
hypergraph coloring
I, K, L
improvement procedure
inapproximability
incoming cocycle
incomparable solutions
increasing chain
independence of irrelevant choices
influence graph
instances
bounded number of occurrences
dense
0 or 1 homogenous
planar
interior product
interval model
inverse combinatorial optimization problem
inverse facility location
INV1-FL
INV1-LC
inverse maximum weight matching
inverse maximum weight perfect
matching
inverse maximum weight stable set
inverse minimum capacity cut
inverse problem constraints
Kleene star
knapsack problem
concave separable integer quadratic
multi-knapsack
quadratic
quadratic multi-knapsack
Lagrangian relaxation
landscape theory
language
level packing
linear assignment
linear space
linearization
list updating
literal
load balancing problem
local optimum
local search
non-oblivious
standard
location
Log-APX
Log-DAPX
LOLA
lower bounds
M, N, O
matching
maximal
maximal weight perfect
maximum
maximum weight
maximum weight perfect
minimal weight perfect
perfect
f-matching
2-matching
k-restrained
maximal weight perfect
perfect
mathematical models
matrix
doubly stochastic
eigenvalues
Kronecker product
trace
MAX BIPARTITE INDUCED SUBGRAPH
maximum independent set
maximum regret criterion
maximum weight stable set
MAX STABLE set
PROBABILISTIC
median
metaheuristics
metric instance
minimum capacity cut
modification strategy
neighborhood
exact
Fiduccia–Mattheyses
flip
Kernighan–Lin
MAX SAT
2-opt
k-opt
structure
swap
network center
neural network
NEXP
nominal value
non-concave problem
non-pre-emptive
norm
LP
NP problems
complete
hard
NPO problems
complete
objective function
optimal tour
optMAX TSP(I)
optMIN TSP(I)
optimality
minmax
Pareto
optimum
global
local
ε-local
ordinal potential
P
paging
Pareto
curve
frontier
optimality
set
stability
partial inverse problem
path
payoff function
PLS
complete
α-point
Poly-APX
Poly-DAPX
polytope
cut
potential
ω
generalized ordinal
PPAD
pre-emptive
precedence graph
preference
strict
preprocessing
prisoner’s dilemma
probabilistic combinatorial optimization
probabilistic longest path
in the number of edges
in the number of vertices
probabilistically checkable proofs
problems
approximable
bicriteria
BIN PACKING
CAPACITY ALLOCATION
CIRCUIT/flip
COLOR SAVING
concave
3-DIMENSIONAL MATCHING
END OF THE LINE
Euclidean MIN TSP
FACILITY LOCATION
GRAPH PARTITIONING
INDEPENDENT SET
k-DENSEST SUBGRAPH
k-LIGHTEST SUBGRAPH
k-MEANS CLUSTERING
k-MEDIAN
k-SET COVER
LIN2
LONGEST PATH
MAX-CONJ
MAX-CUT
maximin
MAX LIN2
MAX MULTI-CUT
MAX-SAT
MAX-2SAT
MAX-3SAT
MAX-SNP
MAX VARIABLE-WSAT
MAX TSP
METRIC LABELING
MIN COLORING
MIN CUT
MIN G-TRANSVERSAL
MIN H-TRANSVERSAL
minimax
MIN LIN2 DELETION
MIN METRIC TSP
MIN SAT DELETION
MIN 2SAT
MIN TSP
MIN VARIABLE-WSAT
MIN VARIABLE-W3SAT
2-monotone
multiflow
neural network
non-concave
on-line
packing
p-center
p-dispersion
p-maximum
p-median
POS NAE MAX-3SAT
P problems
PROBABILISTIC COLORING
PROBABILISTIC MAX STABLE
PROBABILISTIC MIN TSP
quadratic
quadratic assignment
SAT
separable
separation
traveling salesman
0 or 1-valid
VERTEX COVER
WEIGHTED MAX STABLE
worMAX TSP(I)
worMIN TSP(I)
programming
linear
MAX 0–1 linear
MIN 0–1 transversal
primal–dual
quadratic
semi-definite
PTAS
Q, R
quadratic functions
quadratic problems
in 0–1 variables
quasi-concave function
quasi-convex function
randomized on-line algorithms
reduction
AF-
affine
AP-
C-
continuous
FO-
L-
S-
polynomial
strict
relaxation
eigenvalues
Lagrangian
linear
orthogonal
quadratic
semi-definite
resource allocation function
robust solution
rule of choice
S, T
satisfiability
scheduling
search
alternate
hybrid
shortest path
situation
attainable
optimal
social welfare
soft capacities (problem with)
SOLA
solution
neighboring
solution methods
approximate
exact
sort
k-best
complete
Quicksort
spanning tree
minimal weight
stability number
stable set
standard ratio
Steiner trees
strategy
mixed
pure
task
TF
TFNP
total problem
triangular inequality
Turing machine
two-dimensional packing
upper bounds
utility theory
value
objective
optimal
worst
variable fixing
vertex covering
Voronoi diagram
worst tour
worst-case criterion