A Branch-Price-and-Cut Algorithm for the Inventory-Routing Problem.
Guy DesaulniersJørgen Glomvik RakkeLeandro C. CoelhoPublished in: Transp. Sci. (2016)
Keyphrases
- theoretical analysis
- high accuracy
- dynamic programming
- preprocessing
- learning algorithm
- computational complexity
- computationally efficient
- expectation maximization
- computational cost
- objective function
- simulated annealing
- times faster
- k means
- particle swarm optimization
- np hard
- optimal solution
- experimental evaluation
- adjacency graph
- segmentation algorithm
- optimization algorithm
- matching algorithm
- estimation algorithm
- minimum cut
- linear programming
- hidden markov models
- cost function
- search space
- artificial neural networks
- search algorithm
- feature selection