Survivable capacitated network design problem: new formulation and Lagrangean relaxation.
Miguel RiosVladimir MarianovM. GutierrezPublished in: J. Oper. Res. Soc. (2000)
Keyphrases
- network design problem
- lagrangean relaxation
- column generation
- branch and bound
- valid inequalities
- mixed integer programming
- linear programming relaxation
- heuristic solution
- lagrangian relaxation
- integer programming
- network flow problem
- integer program
- linear programming
- mixed integer
- lower bound
- exact solution
- approximation algorithms
- network design
- optimal solution
- branch and bound algorithm
- linear program
- cutting plane
- search algorithm
- combinatorial optimization
- upper bound
- search space
- minimal cost
- lot sizing
- transportation networks
- np hard
- constraint programming
- knapsack problem
- lower and upper bounds
- lp relaxation
- genetic algorithm
- reinforcement learning