Computer Science
Problem Instance
79%
Assignment Problem
66%
Vehicle Routing
66%
Mixed-Integer Linear Programming
66%
Optimization Problem
56%
Computational Complexity
50%
Solution Method
50%
Optimal Assignment
50%
Value at Risk
50%
Problem Formulation
50%
Location Problem
50%
Valid Inequality
46%
Approximation (Algorithm)
37%
Computational Experiment
37%
Failure Propagation
33%
Cascading Failure
33%
Problem Management
33%
Approximate Solution
33%
Minimum Connectivity
33%
Failure Scenario
33%
Load-Balanced
33%
Traveling Salesman Problem
33%
Connected Component
33%
Large-Scale Problem
25%
Linear Programming
23%
Binary Variable
20%
Deterministic Case
16%
Complexity Issue
16%
Providing Service
16%
Considered Problem
16%
Polynomial Complexity
16%
Good Performance
16%
Programming Model
16%
Constrained Optimization
16%
Sparsity
16%
Subgraphs
16%
Directed Graphs
16%
Computer Hardware
16%
Markov Chain
16%
Routing Problem
11%
Branch and Cut
10%
piecewise linear
8%
Computational Time
6%
Network Optimization
6%
Hamiltonian Cycle
6%
Distinctive Feature
6%
Mathematical Programming
6%
Undirected Network
6%
Mathematics
Probability Theory
100%
Conditional Value At Risk
83%
Linear Programming
61%
Integer
61%
Approximation Problem
44%
Truncated Data
33%
Scale Problem
33%
Total Number
33%
Computer Implementation
33%
Optimal Assignment
33%
Sample Path
33%
Conditionals
33%
Probability Distribution
33%
Balanced Model
33%
Traveling Salesman Problem
33%
Integer Programming
33%
Truncation
33%
Network Connectivity
33%
Global Solution
33%
Approximate Solution
33%
Loss Distribution
33%
Conditional Expectation
33%
Data Sample
33%
Connected Component
33%
Vehicle Routing Problem
33%
Asymmetric
33%
Linear Programming Relaxation
23%
Discrete Distribution
22%
piecewise linear
22%
Numerical Experiment
22%
Portfolio Management
16%
Necessary Optimality Conditions
16%
Variance
16%
Risk Measure
16%
Matrix (Mathematics)
16%
Considered Problem
16%
Markov Chain
16%
Convex Programming
14%
Linear Function
14%
Stochastics
11%
Optimality
11%
Objective Function
11%
Maximum Likelihood Method
11%
Nonlinear Term
11%
Sample Size Increase
11%
Explicit Expression
11%
Regulatory Capital
11%
Necessary and Sufficient Condition
11%
Approximates
11%
target distribution π
11%
Engineering
Nodes
66%
Routing Problem
66%
Mixed-Integer Linear Programming
55%
Problem Formulation
50%
Risk Averse
33%
Network Connectivity
33%
Interdiction
33%
Connected Component
33%
Linear Programming
16%
Metrics
16%
Numerical Experiment
16%
Optimality
16%
Optimisation Problem
16%
Solution Method
16%
Good Performance
16%
Scale Problem
16%
Solution Time
16%
Optimal Value
16%
Solution Stage
16%
Constrained Optimization Problem
16%
Sparsity
16%
Joints (Structural Components)
11%
Applicability
11%
Solution Algorithm
11%
Illustrates
8%
Deterministic Case
8%
Computational Complexity
8%
Mixed-Integer Linear Programming Model
8%
Computational Time
8%
