Engineering
Negative Impact
100%
Planning Horizon
83%
Production Planning
80%
Integrated Market
66%
Reinforcement Learning
66%
Level Policy
66%
Warehouses
66%
Polynomial Time
66%
Base Model
66%
Markov Decision Process
66%
Numerical Experiment
40%
Production Unit
33%
Industrial Symbiosis
33%
Computational Complexity
33%
Subproblem
33%
Computation Time
33%
Systems Performance
33%
Maintenance Planning
33%
Demand Management
33%
Replenishment Order
33%
Finite Length
33%
Sufficient Condition
33%
Dynamic Programming
33%
Structural Property
33%
Class Problem
33%
Metrics
33%
Approach Path
33%
Discrete Time
33%
Collected Data
33%
Dimensionality
33%
Generality
33%
Total Profit
33%
Cost Function
33%
Market Power
33%
Solution Procedure
33%
Optimisation Problem
33%
Mathematical Expression
33%
Mathematical Model
33%
Solution Method
23%
Solution Algorithm
16%
Real Life
16%
Solution Time
16%
Multiobjective Problem
16%
Objective Problem
16%
Maximization
16%
Returned Item
16%
Major Problem
16%
Service Provider
11%
Carbon Footprint
11%
Solution Concept
11%
Computer Science
Supply Chain
100%
Negative Impact
83%
Planning Horizon
75%
Markov Decision Process
66%
Reinforcement Learning
66%
Multiobjective
66%
Polynomial Time Algorithm
50%
Fully Polynomial-Time Approximation Scheme
50%
Efficient Algorithm
33%
Allocation Method
33%
inventory cost
33%
Single Machine
33%
Uncapacitated Problem
33%
Time Complexity
33%
Dynamic Programming Algorithm
33%
Structural Property
33%
Complexity Analysis
33%
Exact Algorithm
33%
Inventory Level
33%
Storage Capacity
33%
Demand Management
33%
Polynomial Algorithm
33%
Computational Complexity
33%
Collected Data
33%
Shortest Path Problem
33%
Problem Analysis
33%
Polynomial Time
33%
Solution Procedure
33%
Mixed Integer Programming
33%
Optimization Problem
33%
Maximum Profit
33%
Market Potential
33%
Demand Characteristic
33%
Heuristic Solution
33%
Computation Time
20%
Systems Performance
16%
stackelberg game
16%
discrete-time
16%
Single Objective
16%
Problem Instance
16%
Online Retailer
16%
Real-World Problem
16%
cooperative game theory
15%
Individual Point
11%
Contingency Table
11%
Statistical Information
11%
Categorical Variable
11%
Categorical Data
11%
Phase Algorithm
8%
Solution Method
8%
Mathematics
Correspondence Analysis
66%
Planning Horizon
50%
Cooperative Game
50%
Lower and upper bounds
33%
Heuristic Approach
33%
Structural Property
33%
Integer Programming
33%
Polynomial Time
33%
Method Performs
33%
Inventory Problem
33%
Polynomial
33%
Decomposition Algorithms
33%
Cost Function
33%
Linear Time
33%
Subproblem
33%
Contingency Table
22%