Effects of feasibility cuts in Lagrangian relaxation for a two-stage stochastic facility location and network flow problem.
Amin HosseininasabFatma GzaraPublished in: Optim. Lett. (2020)
Keyphrases
- facility location
- lagrangian relaxation
- multi commodity
- network flow problem
- network design problem
- integer programming
- np hard
- feasible solution
- lower bound
- branch and bound algorithm
- linear programming
- column generation
- dynamic programming
- lower and upper bounds
- minimum cost
- network flow
- shortest path
- minimal cost
- mixed integer programming
- heuristic solution
- valid inequalities
- upper bound
- genetic algorithm
- tabu search
- optimal solution
- bayesian networks