Single-Period Cutting Planes for Inventory Routing Problems.
Pasquale AvellaMaurizio BocciaLaurence A. WolseyPublished in: Transp. Sci. (2018)
Keyphrases
- single period
- cutting plane
- cutting plane algorithm
- routing problem
- inventory models
- integer programming
- capacity expansion
- single product
- column generation
- lower bound
- integer program
- knapsack problem
- valid inequalities
- vehicle routing problem
- mixed integer
- inventory level
- lost sales
- sample path
- shortest path
- finite horizon
- periodic review
- order quantity
- routing algorithm
- vehicle routing
- service level
- np hard
- genetic algorithm
- multistage
- linear program
- inventory control
- benchmark problems
- lead time