Achieving full connectivity of sites in the multiperiod reserve network design problem.
Nahid JafariBryan L. NuseClinton T. MooreBistra DilkinaJeffrey Hepinstall-CymermanPublished in: Comput. Oper. Res. (2017)
Keyphrases
- network design problem
- network design
- approximation algorithms
- branch and bound
- mixed integer programming
- benders decomposition
- production planning
- integer programming
- mixed integer
- transportation networks
- minimal cost
- valid inequalities
- column generation
- lagrangian relaxation
- special case
- genetic algorithm
- branch and bound algorithm
- np hard
- lower bound
- search algorithm
- optimal solution