Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design.
Bernard GendronSaïd HanafiRaca TodosijevicPublished in: Eur. J. Oper. Res. (2018)
Keyphrases
- network design problem
- network design
- capacitated fixed charge
- linear programming
- network flow problem
- communication networks
- valid inequalities
- network architecture
- linear program
- lagrangian relaxation
- optimal solution
- feasible solution
- integer programming
- objective function
- primal dual
- dynamic programming
- mixed integer
- branch and bound algorithm