A branch-and-cut-and-price approach for the capacitated m-ring-star problem.
Edna Ayako HoshinoCid C. de SouzaPublished in: Discret. Appl. Math. (2012)
Keyphrases
- lot sizing
- multi item
- single source
- facility location problem
- multi period
- routing problem
- network design problem
- np hard
- vehicle routing problem
- facility location
- multi source
- fixed charge
- multi commodity
- capacity constraints
- production inventory
- real time
- network design
- evolutionary algorithm
- star shaped
- algebraic structure
- vehicle routing problem with stochastic demands
- network flow problem
- simulated annealing
- lower bound
- case study
- neural network