A MIP-based approach to solve the prize-collecting local access network design problem.
Ivana LjubicPeter PutzJuan José Salazar GonzálezPublished in: Eur. J. Oper. Res. (2014)
Keyphrases
- network design problem
- mixed integer programming
- prize collecting
- network flow problem
- branch and bound
- approximation algorithms
- column generation
- mixed integer
- mathematical programming
- network design
- lot sizing
- minimal cost
- simulated annealing
- integer programming
- genetic algorithm
- lagrangian relaxation
- valid inequalities
- exact solution
- communication networks