TALK KEYWORD INDEX
This page contains an index consisting of author-provided keywords.
A | |
Aggregated gap objective functions | |
Applications | |
arc routing | |
B | |
Balance criteria | |
barriers | |
Bi-level optimization | |
bi-network | |
branch-and-cut | |
Budget-constrained center upgrading | |
C | |
Cable Trays Location | |
Carrier assignment | |
Clustering | |
Complex networks | |
Concepts of robustness | |
Conic programming and interior point methods | |
Connected graph partitioning | |
Continuous Location | |
contrained cut | |
covering | |
covering problems | |
Cutting plane | |
D | |
Deadline-driven logistics | |
Discrete Facility Location | |
Discrete Location | |
Discrete optimisation | |
discrete ordered median problem | |
Districting | |
drones | |
E | |
edge upgrading | |
elastic demand | |
Energy Transformation | |
exact algorithms | |
Exact solution approach | |
F | |
facility delocation | |
facility location problems | |
Fairness in optimization | |
Flow-based connectivity constraints | |
G | |
Geodesic distances | |
graph decomposition | |
Green Energy | |
H | |
Heuristic | |
heuristics | |
hierarchical location | |
hub line | |
hub location | |
Hydrogen refuelling infrastructure | |
I | |
Image segmentation | |
integer programming | |
Integer programming formulations | |
L | |
Linear Programming | |
load-dependent costs | |
location | |
Location on Trees | |
Location Routing Problem | |
Logistics | |
loyal customers | |
M | |
Manhattan distance | |
Math-heuristic | |
Mathematical programming | |
Matheuristics | |
max-cut | |
maximal covering location problem | |
metaheuristics | |
min-cut | |
N | |
Naval Engineering | |
Network design | |
Networks | |
Next-day delivery | |
Normalized cuts | |
O | |
ocation with different norms | |
Offshore Wind Turbines | |
Optimization | |
Optimization methods | |
OR in Agriculture | |
Ordered Median Function | |
Ordered optimization | |
Outsourcing | |
P | |
p-center | |
P-median Location Problem | |
p-median problem | |
p-order cones | |
Pipeline Routing | |
Planar Location Problems | |
Polyhedral analysis | |
power cones | |
Prize Collecting with Capacities | |
R | |
Robust optimization | |
routing | |
S | |
Second Order Cones | |
Segmentation | |
Service design | |
stochastic programming | |
T | |
Travelling salesman | |
U | |
upgrading | |
V | |
Valid Inequalities | |
W | |
weighted region problem | |
Z | |
Zoning Problem |