Computer Science
Perfect Matchings
100%
Branch-and-Bound Algorithm
73%
Randomly Generated Instance
50%
Computational Experiment
48%
Replanning
33%
Mixed Integer Programming
33%
Matheuristics
33%
Classification Rule
33%
Multiple Region
33%
Exact Algorithm
33%
Approximation Algorithms
33%
Location Problem
33%
Linear Programming
33%
Decision Maker
22%
Interpretability
22%
Column Generation
19%
Euclidean Norm
16%
Optimum Location
16%
Analytical Property
16%
Computation Time
16%
Training Process
11%
Case Study
11%
False Negative
11%
Large Data Set
11%
Cost Coefficient
11%
Transport Service
8%
Shortest Path Problem
8%
Efficient Algorithm
8%
Transportation Network
8%
Network Topology
8%
Operating Cost
8%
Transport Mode
8%
Cardinality Restriction
6%
Branch-and-Bound Algorithm Design
6%
Set Formulation
6%
Commercial off the Shelf
6%
Optimum Solution
6%
Programming Model
6%
Integer-Linear Programming
6%
Mathematics
Matching Problem
100%
Perfect Matchings
100%
Edge
53%
Weber Problem
50%
Discrete Approximation
33%
Integer Programming
33%
Discretization
33%
Local Search
33%
Integer
33%
Branching Rules
33%
Stable Set
30%
Rectilinear
16%
Euclidean Norm
16%
Linear Programming
16%
Simple Graph
6%
Cardinality
6%
Upper Bound
6%
Social Sciences
Decision Making
50%
Industrial Sector
50%
Learning Method
50%
Transport
33%
Railway
33%
Human Activities Effects
33%
Carbon Footprint
33%
Road Transportation
33%
Waterway
33%
Operating Cost
33%
Self Evaluation
33%
Production Engineering
33%
Hong Kong
16%
Econometrics
16%
Technology
16%
