Branch-and-Benders-Cut Algorithm for the Weighted Coflow Completion Time Minimization Problem.
Youcef MagnoucheSébastien MartinJérémie LeguayFrancesco De PellegriniRachid ElazouziCédric RichierPublished in: INOC (2022)
Keyphrases
- objective function
- learning algorithm
- detection algorithm
- computational complexity
- search space
- k means
- dynamic programming
- experimental evaluation
- high accuracy
- np hard
- preprocessing
- optimal solution
- cost function
- significant improvement
- probabilistic model
- worst case
- segmentation algorithm
- convex hull
- knapsack problem
- decomposition algorithm
- evolutionary algorithm
- computational cost
- particle swarm optimization
- expectation maximization