Tractable Approximations for Assortment Planning with Product Costs.
Sumit KunnumkalVíctor Martínez-de-AlbénizPublished in: Oper. Res. (2019)
Keyphrases
- production planning
- computationally tractable
- production cost
- total cost
- exact computation
- customer demand
- heuristic search
- life cycle
- planning problems
- motion planning
- computational complexity
- holding cost
- product design
- ai planning
- state space
- integer programming
- np complete
- inventory level
- product quality
- planning process
- product information
- cost savings
- np hard
- search space
- assembly systems
- reinforcement learning
- expected profit