TALK KEYWORD INDEX
This page contains an index consisting of author-provided keywords.
3 | |
3D packing | |
A | |
Adaptation of Vogel's method | |
Adaptive optimization | |
agricultural supply chain | |
Applications | |
Applications: Energy management | |
Approximation algorithm | |
approximation algorithms | |
Assembly Line Balancing | |
B | |
backtracking | |
Batching | |
Beta distribution | |
Bi-objective programming | |
bicycle network design | |
bottom-left-fill algorithm | |
Branch and Cut | |
branch and price | |
branch cut and price | |
branch-and-cut | |
Bus Bunching | |
Bus holding | |
C | |
carbon taxes | |
chromatic violation | |
circular-arc graph | |
city logistics | |
classification | |
Coil-based Scheduling | |
Column generation | |
Combinatorial optimization | |
Complexity | |
congestion | |
Continuous Casting | |
convex relaxation | |
crew scheduling | |
Crowd shipping | |
cumulative routing | |
Cut generation | |
cutting and packing | |
D | |
day-ahead price | |
delivery | |
demand-price dependence | |
discontinuities | |
Districting | |
domination | |
drone logistics | |
drones | |
dynamic programming | |
E | |
e-grocery | |
Economy of Scale | |
Edge coloring | |
electric vehicle routing problem | |
energy consumption bounds | |
Exact algorithm | |
Expectation Maximization | |
extended formulations | |
F | |
Facility location | |
Facility opening and closing | |
Failure | |
Fairness criteria | |
Family Scheduling | |
feature filtering | |
fixed-charge network design problem | |
fixture of artistic competitions | |
flexgrid | |
food security | |
Forest road planning | |
Forestry | |
formulations | |
G | |
game importance | |
geodesic convexity | |
Geological uncertainty | |
geosciences | |
GQAP | |
graph coloring | |
H | |
Harvest planning | |
Health care planning | |
Heterogeneous Workers | |
Heuristic algorithm | |
Heuristics | |
Hierarchical mixture model | |
High tech Industry | |
hub location | |
I | |
Infrastructure resizing | |
Integer Linear Programming | |
integer program | |
Integer Programming | |
interruptible appliances | |
Iterated Local Search | |
K | |
k-plexes | |
L | |
labeling algorithms | |
Lagrangean decomposition | |
Lagrangean relaxation | |
Large-scale optimization | |
last-mile | |
Last-mile delivery | |
LLRP | |
loading/unloading bays | |
local search | |
location routing | |
lockers | |
lot-sizing | |
M | |
Machine Scheduling | |
maintenance scheduling | |
Maritime Shipping | |
Maritime Transportation | |
mass customisation | |
math-heuristic | |
mathematical model | |
Mathematical Modelling | |
mathematical programming | |
Maximal Covering Location Problem | |
MDCCVRP | |
Metaheuristics | |
Mine planning | |
minimum knapsack | |
MINLP | |
mixed integer linear programming | |
Mixed Integer Programming | |
Mixed integer quadratically constrained program | |
Mixed Integer Second Order Cone Optimization | |
Mixed linear programming | |
Mixed-integer non-linear programming | |
Mixed-integer program | |
Mobile depot | |
multi-component system | |
multi-criteria | |
multi-layer network | |
Multi-stage programming with recourse | |
multicore | |
N | |
nesting | |
Net Present Value | |
Network Analysis | |
Network Design | |
Network flows | |
Network Reliability | |
network routing | |
networking | |
Nutritional status | |
O | |
Online social networks | |
OpenMP | |
optical networks | |
optimal location and assignment | |
optimization | |
Order picking | |
P | |
p-Center Problem | |
packing problems | |
Pandemic Effects | |
Parallel machine scheduling | |
peasant farmers | |
polyhedral combinatorics | |
Polyhedral study | |
production planning | |
profit maximization | |
Public health care | |
Public transport | |
Q | |
QKP | |
quadratic 0-1 optimization problems with linear constraints | |
R | |
Rare events | |
Real-time | |
real-world application | |
Real-world instances | |
release dates | |
remaining useful life | |
residential power scheduling | |
resource balancing | |
Resource‑Constrained Project Scheduling Problem | |
Retail | |
retailing | |
RLT bounds | |
road network | |
routing | |
routing and assignment | |
routing and spectrum assignment problem | |
S | |
Scenario reduction | |
scheduling | |
Schools | |
separation routines | |
Setup Times | |
simulated annealing | |
Simulation | |
simultaneous | |
smart grids | |
soft rectangles | |
sparse solutions | |
sports scheduling | |
Steel Scheduling | |
Stochastic destinations | |
Stochastic optimization | |
storage location assignment | |
Strategic Berth Allocation | |
strategic capacity planning | |
T | |
Tabu Search | |
technological alternatives | |
technological transition | |
Timber loading sites | |
time-dependent times | |
time-sensitive demand | |
Time-space network | |
tournament design | |
travelling salesman problem | |
Two-stage stochastic model | |
U | |
Unbalanced assignment problem | |
Urban consolidation centre | |
V | |
variable neighborhood search | |
vehicle routing | |
vehicle routing problem | |
vertex set partition | |
Vessel Scheduling | |
VLSI design | |
W | |
waste collection | |
web graph | |
Workload Allocation Problem | |
worst-case analysis |