TALK KEYWORD INDEX
This page contains an index consisting of author-provided keywords.
$ | |
$\Delta$-modular matrix | |
$m$-Peripatetic Salesman Problem | |
1 | |
1-skeleton | |
2 | |
2-clustering | |
2-D strip packing problem | |
A | |
Accelerated Proximal Envelopes | |
age groups | |
agglomerative clustering | |
air pollution | |
Aircraft Flows Merging | |
algorithm | |
algorithms | |
Altruistic equilibrium | |
and | |
Applications | |
approximate solutions | |
approximation algorithm | |
approximation algorithms | |
arc routing | |
ARIMA | |
asymptotic optimality | |
Asymptotically exact algorithm | |
atomic-molecular clusters | |
attacker-defender model | |
Autarky | |
B | |
Banach space | |
bar charts | |
BATS | |
Berge equilibrium | |
bilevel mathematical programming problems | |
Bilevel optimization | |
Bilevel problems with a nonconvex lower level | |
bilevel programming | |
Bimatrix game | |
bin packing | |
bit patterns | |
boolean satisfiability problem | |
boundary control | |
Branch and Bound | |
Branch-and-Bound algorithm | |
breakdown | |
C | |
CADNA library | |
Caputo-Fabrizio derivative | |
cardinality-constrained optimization problem | |
Catalyst | |
CESTAC method | |
Characteristic function | |
Chebyshev center | |
Clark's derivative | |
Classification | |
cluster analysis | |
cluster ensemble | |
co-association matrix | |
column generation | |
combinatorial optimization | |
Comparative Statics | |
competitive location | |
complementarity | |
computational complexity | |
computational experiments | |
computational social choice | |
Computational study | |
computational technology | |
Conclusions | |
conditions for improving control | |
conflict graph | |
constant elasticity of substitution | |
constrained knapsack problem | |
consumer behavior | |
Consumer Surplus | |
Continuity equation | |
continuous updating | |
Contractual production economies | |
control | |
control improvement problem | |
convergence | |
convex optimization | |
convex problem | |
convex programming | |
convex sets | |
Convolution | |
COVASIM software | |
Cover | |
COVID-19 | |
Customer Features | |
Cutting-plane methods | |
D | |
data analysis | |
Data bus | |
data reduction | |
DC functions | |
DC programming | |
Decentralized optimization | |
decomposition technique | |
degenerate operator | |
dengue transmission model | |
detection | |
dial-a-ride | |
Differential games | |
diffusive-logistic model | |
dimensionality reduction | |
Dirichlet tessellation | |
Discassion | |
Discrete facility location | |
Discrete Optimization | |
discrete optimization problem | |
discrete-continuous system | |
discrete-time maximum principle | |
discrimination | |
distributionally robust optimization | |
Dixit-Stiglitz Model | |
Dixit-Stiglitz-Krugman Model | |
Dixit–Stiglitz–Krugman Model | |
Double Description Method | |
Doubling dimension | |
duality | |
duality gap | |
Dynamic games | |
E | |
economic development models | |
Efficient PTAS | |
Elastic demand | |
electric power system | |
emission quotas | |
energy security | |
energy storages | |
Energy supply-demand system | |
Entrance Fee | |
equal-lenght | |
Euclidean distance | |
Euclidean space | |
evolutionary algorithms | |
exact algorithm | |
Exact Penalization Theory | |
F | |
facet | |
facility location | |
fast automatic differentiation | |
Feedback minimum principle | |
Fennel duality | |
finite adaptability | |
First-order methods | |
fixed point | |
fixed point problem | |
fixed-parameter algorithm | |
flowshop | |
forecasting | |
forecasts | |
FPTAS | |
Fractional differential equations | |
Free Trade | |
Frienkin-Johnsen model | |
G | |
game | |
gas production | |
gas transmission network | |
gas treatment | |
genetic algorithm | |
Genetic algorithms | |
Geometric median | |
given-diameter Minimal Spanning Tree | |
Global Optimality Conditions | |
global optimization | |
Global search scheme | |
Global Search Theory | |
GNU Octave | |
gradient | |
Gradient Descent | |
gradient method | |
gradient methods | |
graph adjacency test | |
graph clustering | |
Graph partitioning | |
Graphical models | |
greedy algorithm | |
greedy algorithms | |
guaranteed approximation ratio | |
H | |
Hamiltonian cycle | |
Hamiltonian decomposition | |
heat conduction | |
heuristic | |
high point relaxation | |
Holt's model | |
hybrid algorithm | |
Hölder Continuity | |
I | |
identifiability | |
ill-posed problems | |
Improper linear programming problems | |
Inconsistent linear systems | |
inexact oracle | |
infeasibility | |
influence | |
instance reduction | |
Integer linear programming | |
Integer Programming | |
integrated welfare | |
intermediate conditions | |
Interval constraints | |
inverse and ill-posedproblem | |
inverse coefficient problems | |
inverse optimal control | |
inverse problem | |
Inverse problems | |
Investments in R&D | |
Irregular Polyomino Tiling | |
iterative algorithm | |
K | |
k-means | |
kernelization | |
knapsack problem | |
L | |
Lagrange multipliers | |
Lagrange theorem | |
Lagrangian dual bounds | |
Lagrangian methods | |
Large scale combinatorial optimization | |
lifetime | |
linear combinatorial optimization | |
linear discrete-time systems | |
Linear externalities | |
Linear Programming | |
linearization | |
linearized function | |
Lipschitz derivatives | |
Lipschitz global optimization | |
local convergence | |
local optima | |
Local search | |
local search algorithm | |
Local Search Methods | |
Local Tuning | |
Logistics | |
Low stochastic noise | |
low-rank matrix decomposition | |
M | |
Machine Learning | |
Maintenance planning | |
manifold regularization | |
MAPE | |
mapping | |
Marginal cost pricing | |
Market Equilibrium | |
Massive MIMO | |
Mathematical Modeling | |
matheuristics | |
Matrix correction Polyhedral norms | |
Max TSP | |
Maximizing the Minimum Load | |
maximum clique problem | |
Maximum spanning tree | |
MaxSAT problem | |
MCP-equilibrium | |
mean | |
medoid | |
merging variables principle | |
metaheuristic | |
Metaheuristics | |
Metric space | |
MILP | |
Minimum-sum-of-squares clustering | |
Mixed integer linear programming | |
Mixed Integer Programming | |
mixed-integer linear programming | |
mixed-integer model | |
mixed-integer programming | |
mixed-integer quadratic programming | |
Modified Ramsey model | |
monotonicity | |
MU-MIMO Precoding | |
Multi-agent dynamic systems | |
Multi-core processor | |
multi-objective optimization | |
multi-subnet urban road network | |
multicriteria games | |
multidimensional knapsack | |
multiextremal function | |
multiple cluster scheduling problem | |
Multiple criteria | |
multiple global optimization | |
multiple strip packin problem | |
multiple visits | |
multiprocessor job | |
Must-Pass Nodes | |
N | |
Nash bargaining solution | |
Nash equilibrium | |
Network models | |
networks | |
Non-convex optimization | |
Non-convex technologies | |
non-linear extension | |
non-linear optimization | |
non-smooth optimization problem | |
non-smooth penalty method | |
Nonconvex problem | |
nonsmooth optimization | |
NP-hard problem | |
NP-hard problems | |
NP-hardness | |
Numeric algorithms for optimal control | |
numerical algorithm | |
O | |
one-point bandit | |
Operational Research | |
Operations research | |
optima localization | |
Optimal control | |
optimal release program | |
optimal vibration control | |
optimality conditions | |
Optimality Criteria | |
Optimistic solution | |
Optimization | |
optimization method | |
optimization problem | |
optuna | |
order picking | |
Ottaviano-Tabuchi-Thisse Utility | |
Outliers | |
P | |
p-median | |
packing | |
parallel machine | |
parallel machines | |
parameterized complexity | |
Parametric optimality | |
partitioning | |
Path Problem | |
performance guarantee | |
phased antenna arrays | |
Phased Array Antenna | |
picking | |
piecewise constant control | |
polyhedral complex | |
polyhedral loss function | |
Polyhedral relaxation | |
polyhedral uncertainty | |
polyhedral-ellipsoid set | |
polyhedron | |
polynomial-time solvability | |
Pontryagin's maximum principle | |
Positive-unlabelled classification | |
Post-optimal analysis | |
potentiality | |
Power Allocation | |
pre-Autarky | |
Precoding | |
predistorion | |
preemption | |
Price of Anarchy | |
pricing and placement problem | |
probabilistic analysis | |
Probabilistic criterion | |
probability criterion | |
problem kernelization | |
Problem with d.c. constraints | |
Proximal minimization | |
PTAS | |
Public procurement | |
Q | |
quadratic control system | |
Quadratic Programming | |
Quantile criterion | |
quasiperiodic sequence | |
R | |
r-algorithm | |
Radio Resource Management | |
random horizon | |
Random variable networks | |
Reduction theorem | |
Regression Trees | |
regularization | |
Relative Lipschitz-Continuity | |
relaxation | |
Renewable resources | |
resource region | |
Retailing | |
robust optimization | |
Robustness | |
routing | |
routing open shop | |
rural postman problem | |
S | |
Saddle Point Problem | |
saddle-point problem | |
Saddle-point problems | |
Safety Interval | |
sample average approximation | |
scheduling | |
scheduling polytope | |
scheduling theory | |
scheduling theory problems | |
search information | |
Seating optimization | |
semidefinite programming | |
separable and quasi-separable functions | |
Separable structures | |
set-valued network equilibrium problem | |
Shapley Value | |
shortest path problem | |
sigmoid function | |
simplex | |
Simulated Annealing | |
simulation | |
single machine | |
Single-bidder auctions | |
singular value decomposition | |
SIR | |
skyline heuristics | |
smooth approximation | |
smoothing kernel | |
social network | |
Social Welfare | |
source problem | |
space extension | |
space stretching | |
SPARK | |
speed scaling | |
speed-in-action problem | |
sphere covering problem | |
sphere packing problem | |
Split delivery service | |
Stackelberg Equilibrium | |
Stackelberg game | |
standard lower bound | |
stochastic duration | |
Stochastic gradient descent | |
stochastic local search | |
stochastic optimization | |
stochastic programming | |
strategic planning | |
strip packing | |
strong NP-hardness | |
Strong stability radius | |
Strongly Concave-convex Saddle Point Problem | |
subgradient methods | |
subgradient projection method | |
subsoil development program | |
Subspace identification | |
Subtour elimination constraints | |
sum-of-square clustering | |
supply route | |
system of neighborhoods | |
T | |
tariff regulation | |
TBATS | |
temporal graphs | |
terminal constraints | |
the local dynamics of welfare | |
three-level optimization | |
Time windows | |
total weight of on-time jobs | |
traffic assignment problem | |
transport robot | |
Traveling salesperson polytope | |
Truck-and-drone | |
Ttraveling Salesman Problem | |
two-level set | |
two-speed step-size choice | |
U | |
Uncapacitated vehicles | |
Uncertain input data | |
Uncertainties | |
uncertainty | |
Uncertainty of graphical model selection | |
Uncertainty of Kruskal algorithm | |
V | |
Value-at-Risk | |
variable neighborhood search | |
Variable neighbourhood descent | |
variables separation | |
Variation Interval | |
Variational Inequality | |
vehicle routing | |
Vehicle Routing problem | |
Vertex adjacency | |
virtual machine | |
Volterra integral equation | |
W | |
weakly optimal solution | |
weakly supervised learning | |
weight reduction | |
Weighted minimax criterion | |
wireless | |
Wolbachia-based biocontrol | |
Y | |
Young transform | |
Z | |
Zeroth-order methods | |
zeroth-order optimization |