Mixed-integer optimization for the combined capacitated facility location-routing problem.
Dimitri PapadimitriouDidier CollePiet DemeesterPublished in: DRCN (2016)
Keyphrases
- mixed integer
- lot sizing
- facility location
- network design problem
- global optimization problems
- network flow problem
- quadratic program
- benders decomposition
- vehicle routing problem
- mixed integer programming
- linear program
- continuous relaxation
- feasible solution
- convex hull
- continuous variables
- valid inequalities
- cutting plane
- optimal solution
- routing problem
- multistage
- np hard
- lead time
- global optimization
- combinatorial optimization
- lagrangian heuristic
- quadratic programming
- minimal cost
- traveling salesman problem
- objective function