The Multi-Commodity Flow Problem with Disjoint Signaling Paths: A Branch-and-Benders-Cut Algorithm.
Jiachen ZhangYoucef MagnoucheSébastien MartinAntoine FressancourtJ. Christopher BeckPublished in: CoDIT (2023)
Keyphrases
- experimental evaluation
- detection algorithm
- preprocessing
- significant improvement
- cost function
- learning algorithm
- dynamic programming
- times faster
- optimization algorithm
- high accuracy
- worst case
- k means
- computational complexity
- expectation maximization
- optimal solution
- decomposition algorithm
- path length
- knapsack problem
- upper bound
- segmentation algorithm
- np hard
- bayesian networks