Business & Economics
Activation
8%
Assignment
13%
Assignment Problem
10%
Branch-and-bound
7%
Convex Hull
9%
Costs
18%
Cutting Planes
12%
Decomposition
11%
Decomposition Algorithm
15%
Destination
10%
Dynamic Programming
8%
Efficacy
8%
Facility Location
8%
Filter
9%
Follower
18%
Graph
9%
Heuristics
7%
Integer
24%
Integer Programming
20%
Linear Programming
10%
Linearization
19%
Mathematical Programming
8%
Mixed Integer Program
21%
Mixed Integer Programming
26%
Network Design
21%
Network Flow
10%
Network Flow Problem
8%
Node
34%
NP-hard
11%
Objective Function
14%
Operations Research
11%
Optical Networks
14%
Optimal Solution
11%
Optimality
9%
Optimization Problem
17%
Placement
9%
Planning
11%
Procurement
9%
Radiation
11%
Routing Problem
11%
Scenarios
13%
Sensor
14%
Shortest Path Problem
17%
Telecommunications
8%
Tournament
15%
Traveling Salesman Problem
12%
Valid Inequalities
14%
Value Function
9%
Wireless Sensor Networks
9%
Workload
8%
Mathematics
Activation
10%
Arc of a curve
22%
Attack
11%
Branch-and-price
14%
Computational Results
10%
Computing
9%
Convex Hull
11%
Costs
25%
Covering Problem
10%
Cutting Plane Algorithm
18%
Cutting Planes
10%
Decomposition Algorithm
10%
Demonstrate
10%
Denial of Service
8%
Efficacy
12%
Exact Algorithms
13%
Filter
12%
Formulation
10%
Game
11%
Heuristics
9%
Integer
11%
Integer Programming
14%
Interleaving
12%
Lifetime
9%
Maximise
10%
Minimum Cost Flow
10%
Mixed Integer Program
20%
Mixed Integer Programming
13%
Model
14%
Network Design
10%
Network Flow Problem
10%
Operations Research
9%
Optimization Algorithm
11%
Optimization Problem
9%
Packing Problem
10%
Partial
8%
Path
9%
Placement
10%
Programming Model
11%
Reformulation-linearization Technique (RLT)
27%
Robust Optimization
8%
Scenarios
11%
Sensor
19%
Subgraph
12%
Telecommunications
9%
Thermal Model
12%
Tournament
9%
Valid Inequalities
15%
Vertex of a graph
28%
Wireless Sensor Networks
15%
Engineering & Materials Science
Baseball
6%
Basketball
6%
Binary decision diagrams
6%
Chemical activation
12%
Combinatorial optimization
6%
Communication
5%
Costs
40%
Decomposition
30%
Decontamination
6%
Denial-of-service attack
5%
Disasters
5%
Dynamic programming
38%
Fiber optic networks
16%
Free flight
6%
Graph theory
5%
Hot Temperature
6%
Integer programming
100%
Linear programming
21%
Linearization
19%
Mathematical programming
10%
Mobile agents
5%
Multiobjective optimization
5%
Network theory (graphs)
5%
NP-hard
34%
Operations research
9%
Parallel algorithms
8%
Parameter extraction
5%
Planning
13%
Polynomials
12%
Profitability
10%
Radar
5%
Radiation
7%
Radiotherapy
11%
Relaxation
16%
Scheduling
6%
Sensors
13%
Set theory
24%
Stars
6%
Stochastic models
6%
Telecommunication networks
7%
Traveling salesman problem
16%
Trees (mathematics)
5%
Uncertainty
8%
Wireless sensor networks
26%
