Computer Science
Data Envelopment Analysis
80%
Analysis Model
50%
Computational Approach
40%
Efficiency Measure
40%
Traveling Salesman Problem
40%
Column Generation
40%
Vehicle Routing
40%
Problem Instance
40%
Decision-Making
40%
Linear Programming
27%
Binary Variable
24%
First-Come-First-Served
20%
Systems Performance
20%
Convex Function
20%
System Dynamics
20%
Programming Technique
20%
Large-Scale Problem
16%
Valid Inequality
16%
Production Technology
10%
Mixed-Integer Linear Programming
8%
Computational Time
8%
Hamiltonian Cycle
8%
Branch and Cut
8%
Mathematical Programming
8%
Network Optimization
8%
Optimization Problem
8%
Distinctive Feature
8%
Undirected Network
8%
Mathematics
Stochastics
100%
Data Envelopment Analysis
80%
smooth curve γ
40%
Column Generation
40%
Traveling Salesman Problem
40%
Asymmetric
40%
Marginals
26%
Convex Function
20%
Treated Group
20%
Stochastic Process
20%
arrival rate λ
20%
Reliable Estimate
13%
Optimal Estimate
13%
Point Estimate
13%
Necessary Condition
13%
Lower and upper bounds
13%
Analysis Model
10%
Production Technology
10%
Convex Set
10%
Parametric
10%
Linear Programming Relaxation
8%
Cut Algorithm
8%
Mathematical Programming
8%
Complete Graph
8%
Hamiltonian Cycle
8%
Inferential Statistics
6%
Random Noise
6%
Total Weight
5%
Objective Function
5%
Path Problem
5%
Probability Theory
5%
Variance
5%
Increasing Function
5%
Engineering
Distance Function
80%
Directional
80%
Constant Return
60%
Convex Set
40%
Units of Measurement
40%
Isoquants
40%
Routing Problem
40%
Scale Size
40%
Scale Production
40%
Euclidean Distance
30%
Scale Problem
20%
Base Model
20%
Size Scale
20%
Scale Model
20%
Similarities
10%
Relative Price
10%
Mixed-Integer Linear Programming
10%
Computational Time
10%
Output Vector
10%
Efficiency Indicator
10%