Keyphrases
Approximation Accuracy
11%
Branch-and-bound Algorithm
35%
Branch-and-cut
23%
Column Generation
11%
Computational Study
23%
Continuous-time
70%
Cost Reduction
11%
Customer Location
11%
Customer Request
11%
Customer Service
11%
Delivery Service
11%
Discovery Algorithm
11%
Dispatcher
11%
Dynamic Discretization Discovery
35%
Dynamic Vehicle Routing Problem
23%
Expected Cost
23%
FedEx
11%
Formulation Optimization
15%
Fundamental Building Blocks
11%
Integer Optimization
23%
Inventory Routing Problem
70%
K-nearest
23%
Linear Optimization
23%
Logistics Network
11%
Low-level Heuristics
18%
Mixed-integer Optimization
15%
Neighbor-based
23%
Novel Algorithm
11%
Performance Guarantee
11%
Pricing Mechanism
11%
Product Inventory
11%
Realization Probability
23%
Routing Problem
23%
Sequence-dependent
11%
Skipping
11%
Stackelberg Game
23%
Stackelberg Security Game
23%
Stochastic Routing
11%
Stochastic Vehicle Routing Problem
23%
Storage Capacity
19%
Storage Products
11%
Termination Condition
11%
Time-Sensitive Networking
31%
Time-variant
35%
Travel Cost
11%
Travel Time
23%
Travel Time Estimation
23%
Vehicle Route
11%
Vehicle Routing Problem
23%
Vehicle Travel
11%
INIS
algorithms
89%
applications
5%
approximations
9%
capacity
15%
comparative evaluations
8%
cost
26%
data
11%
decomposition
11%
delivery
20%
dynamics
50%
efficiency
5%
information
7%
inventories
58%
learning
13%
levels
13%
optimization
51%
planning
15%
prediction
7%
prices
46%
probabilistic estimation
23%
probability
9%
programming
5%
reaction kinetics
7%
resources
7%
routing
100%
schedules
7%
security
23%
solutions
56%
stabilization
5%
stochastic processes
16%
storage
15%
time dependence
7%
travel
28%
units
7%
vehicles
41%
Computer Science
Approximation (Algorithm)
11%
Branch and Cut
11%
Building-Blocks
11%
Column Generation
11%
Combinatorial Optimization Problem
23%
Continuous Time
46%
Critical Component
11%
Decomposition Method
7%
Deep Learning Model
23%
Discretization
35%
Distribution Network
11%
Haversine Distance
23%
Hyper-Heuristic
23%
Integer Programming
7%
k-Nearest Neighbors Algorithm
23%
Metaheuristics
14%
Observation Time
23%
Optimization Formulation
15%
Optimization Stage
11%
Performance Guarantee
11%
Potential Customer
11%
Randomly Generated Instance
5%
Routing Problem
70%
Security Application
7%
Service Request
11%
stackelberg game
23%
Storage Capacity
17%
Termination Condition
11%
Traffic Pattern
23%
Vehicle Routing
32%
