A Branch-and-Cut algorithm for the Capacitated Multi-Failure Survivable Network Design problem.
Sylvie BorneÉric GourdinOlivier KlopfensteinAli Ridha MahjoubPublished in: Comput. Ind. Eng. (2018)
Keyphrases
- network design problem
- network flow problem
- np hard
- approximation algorithms
- dynamic programming
- mixed integer programming
- worst case
- branch and bound
- heuristic solution
- network design
- linear programming
- cost function
- neural network
- routing problem
- probabilistic model
- computational complexity
- optimal solution
- mixed integer