INIS
algorithms
100%
applications
61%
approximations
36%
blending
21%
capacity
31%
capture
19%
constraints
53%
control
11%
cost
13%
cutting
14%
data
13%
decomposition
21%
design
20%
distribution
12%
dynamics
17%
equilibrium
17%
failures
45%
graphs
59%
labelling
10%
length
21%
linear programming
33%
mathematical models
11%
mines
61%
mining
33%
modeling
13%
nonlinear problems
21%
open pit mining
28%
optimization
63%
ores
37%
parks
19%
performance
22%
pits
67%
planning
39%
probability
25%
processing
20%
production
57%
programming
41%
randomness
27%
relaxation
22%
reliability
43%
resources
20%
risks
46%
schedules
16%
solutions
46%
stochastic processes
44%
stockpiles
30%
topology
14%
utilities
17%
values
52%
wastes
16%
Keyphrases
Adaptive Partitioning
11%
At-risk
20%
Branch-and-bound Algorithm
11%
Branch-and-cut
10%
Capacity Constraints
11%
Computational Experiment
35%
Conditional Value
17%
Convex Envelope
8%
Copula Model
25%
Cutting Planes
12%
De Bruijn Graph
17%
De Bruijn Sequence
44%
Decomposition Algorithm
17%
Dependent Failure
25%
Equilibrium Model
9%
Eulerian Circuit
17%
Extracted Materials
9%
Failure Model
17%
Integer Linear Programming
11%
Integer Models
10%
Labeled Digraph
12%
Linear Programming
27%
Lyndon Words
10%
Marshall-Olkin Copula
25%
Mathematical Model
12%
Maximal Bicliques
11%
Media Capture
17%
Mine Planning
11%
Mixed Integer Programming
14%
Net Present Value
12%
Network Reliability
8%
Number of Parameters
11%
Open pit Mine Production Scheduling
42%
Open pit Mining
25%
Open-pit Mine
9%
Park-and-ride Facilities
11%
Partitioning Method
11%
Precedence Constrained Knapsack Problem
17%
Production Scheduling
14%
Production Scheduling Problem
24%
Random Utility
17%
Risk Measures
10%
Risk-averse
13%
Robust Optimization
11%
Scheduling Model
10%
Telecommunication Network
17%
Telecommunications
15%
Travel Time
12%
Two-stage Stochastic Programming
12%
WDM Networks
17%
Computer Science
Absorbing Markov Chain
8%
Approximation (Algorithm)
24%
Backhaul Network
8%
Bipartite Graph
17%
Branch and Cut
8%
Branch-and-Bound Algorithm
12%
Complex Networks
8%
Component Failure
12%
Computational Experiment
32%
Computational Resource
8%
Concave Function
8%
Control Plane
8%
Design Problem
8%
digraph
8%
Directed Graphs
8%
Encoding Algorithm
8%
Exact Reliability
17%
Feasible Solution
11%
Greedy Algorithm
8%
Integer Programming
25%
Integer-Linear Programming
17%
Knapsack Problem
11%
Linear Program
12%
Linear Programming
34%
Mixed Integer Programming
21%
Model Failure
25%
Model for Network
8%
Network Design
14%
Network Reliability
17%
Network Resource
8%
Network Routing
8%
Network Traffic
8%
Objective Function
14%
Optimization Problem
13%
Packet Network
8%
Packing Problem
8%
Partitioning Method
8%
Preliminary Investigation
8%
Primal-Dual
8%
Problem Instance
8%
Production Scheduling
47%
Programming Model
14%
Project Scheduling
8%
Resource Utilisation
8%
Scheduling Problem
47%
Stochastic Problem
12%
Telecommunication Network
17%
Topological Optimization
8%
Value at Risk
17%
Wireless Backhaul
8%