Business & Economics
Integer
52%
Production/scheduling
45%
Scheduling Problem
40%
Schedule
31%
Air Transportation
31%
Traveling Salesman Problem
30%
Mixed Integer Programming
29%
Optimality
28%
Connectivity
25%
Seat
25%
Local Search
22%
Resource-constrained Project Scheduling
21%
Cutting Planes
20%
Net Present Value
20%
Integer Programming
19%
Forest Planning
19%
Set Covering Problem
18%
Linear Programming
17%
Fractional Programming
17%
Planning
16%
Waterways
15%
Network Flow
15%
Mixed Integer Program
15%
Capacity Constraints
13%
Heuristics
12%
Parity
12%
Deposits
12%
Fidelity
12%
Buffer
11%
Valid Inequalities
11%
Time Horizon
11%
Travellers
11%
Resources
10%
Optimization Problem
10%
Certification
10%
Nature Reserve
9%
Test Collections
9%
Traveling Salesman
9%
Minerals
8%
Metals
8%
Wildlife
7%
Habitat
7%
Shared Resources
7%
Clique
7%
Graph
7%
Branch and Bound Algorithm
7%
Methodology
6%
Uncertainty
6%
Optimal Solution
6%
Ship
6%
Engineering & Materials Science
Scheduling
100%
Integer programming
88%
Linear programming
43%
Relaxation
41%
Planning
33%
Traveling salesman problem
27%
Ores
26%
Seats
23%
Open pit mining
21%
Natural resources management
19%
Polynomials
17%
Gold mines
17%
Machine learning
16%
Mineral industry
14%
Deposits
13%
Operations research
12%
Availability
12%
Random forests
11%
Stars
11%
Minerals
9%
Subroutines
8%
Jet aircraft
8%
Shovels
8%
Digital arithmetic
7%
Forestry
7%
Industry
7%
Loaders
7%
Experiments
7%
Uncertainty
7%
Local search (optimization)
6%
Decomposition
6%
Ships
6%
Classifiers
6%
Costs
5%
Trucks
5%
Mathematics
Mining
45%
Knapsack
34%
Knapsack Problem
30%
Resource-constrained Project Scheduling
28%
Travelling salesman problems
24%
Scheduling Problem
23%
Integer
20%
Heuristics
19%
Optimality
19%
Schedule
17%
Computational Experiments
16%
Certification
16%
Set Covering Problem
15%
Dantzig-Wolfe Decomposition
14%
Fractional Programming
14%
Net Present Value
14%
Tilting
14%
Decomposition Algorithm
13%
LP Relaxation
13%
Buffer
13%
Valid Inequalities
12%
Metals
12%
Mixed Integer Programming
11%
Scheduling
11%
Parity
11%
Polyhedron
10%
Benchmark
10%
Scenarios
10%
Connectivity
10%
Framework
9%
Uncertainty
9%
Cutting Plane Algorithm
9%
Requirements
9%
Production/scheduling
8%
Entire
8%
Transition Model
7%
Performance
7%
Branch-and-cut
7%
Project Scheduling
7%
Clique
7%
Rounding
7%
Branch-and-bound
6%
Date
6%
Class
6%
Industry
5%
Maximise
5%
Design
5%
Convex Hull
5%
Linear programming
5%
