The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design.
Mervat ChoumanTeodor Gabriel CrainicBernard GendronPublished in: EURO J. Comput. Optim. (2018)
Keyphrases
- network design
- network design problem
- capacitated fixed charge
- dynamic programming
- objective function
- worst case
- computational complexity
- np hard
- particle swarm optimization
- combinatorial optimization
- special case
- lower bound
- upper bound
- multistage
- knapsack problem
- communication networks
- minimal cost
- optimal solution
- neural network