Computer Science
Routing Problem
100%
Variable Neighborhood Search
41%
Collection System
25%
Perfect Matchings
25%
Garbage Collection
18%
Benchmark Instance
18%
Simulation Study
18%
Solution Quality
18%
Vehicle Routing
12%
Bin Packing Problem
12%
Competitive Analysis
12%
Tabu Search
12%
Private Individual
12%
Pickup and Delivery Problem
12%
Operational Cost
12%
Transport Cost
12%
Customer Class
12%
Data Instance
12%
Bayesian Framework
12%
Smaller Collection
12%
Traveled Distance
12%
Greedy Algorithm
12%
Location Problem
12%
Mixed-Integer Linear Programming
12%
Transport Vehicle
12%
Branch and Cut
12%
on-line algorithm
10%
Duration Constraint
10%
Computational Experiment
10%
Resource Variant
8%
Metaheuristic Algorithm
6%
Markov Decision Process
6%
Time Information
6%
Estimation Accuracy
6%
Speed-up
6%
Benchmark Problem
6%
Adaptive Large Neighborhood Search
6%
Continuous Variable
6%
Online Customer
6%
Bayesian Approach
6%
Machine Learning
6%
Customer Satisfaction
6%
Multilevel Model
6%
Minimization Problem
6%
Neighbor Method
6%
Application Code
6%
Matching Algorithm
6%
Preprocessing Phase
6%
Order Information
6%
Objective Function
6%
Mathematics
Edge
25%
Time Window
25%
Column Generation
25%
Service Time
25%
Optimality
18%
Real Life
16%
Mathematical Modeling
12%
Smaller Collection
12%
Stochastics
12%
Closeness
12%
Packing Problem
12%
Bayesian
12%
Cube
12%
Minimizes
12%
Branch And Price
12%
Price Algorithm
12%
Cut Node
12%
Generation Rate
12%
Frequentist
12%
Inventory Problem
12%
Benders Decomposition
12%
Covering Problem
12%
Cut Algorithm
12%
Bayesian Model
8%
Bayesian Approach
8%
Integer
8%
Complete Undirected Graph
6%
Future Price
6%
Engineering
Routing Problem
25%
Real Life
12%
Incineration
12%
Nearest Neighbor
12%
Compression Factor
12%
Bayesian Model
12%
Applicability
12%
Railway
12%
Search Neighborhood
12%
Bayesian Approach
12%
Bayesian Framework
12%
Disposal Facility
12%
Service Time
6%
Preprocessing Phase
6%
Collection Problem
6%
Confidence Interval
6%
Infrastructure
6%
Programming Model
6%
Least Square
6%
Linear Programming
6%
Production Waste
6%
Maximum Likelihood Estimation
6%
Collected Data
6%
Transfer Stations
6%
