Branch-and-Benders-Cut Algorithm for the Weighted Coflow Completion Time Minimization Problem

Youcef Magnouche, Sébastien Martin, Jérémie Leguay, Francesco De Pellegrini, Rachid Elazouzi, Cédric Richier. Branch-and-Benders-Cut Algorithm for the Weighted Coflow Completion Time Minimization Problem. In Christina Büsing, Arie M. C. A. Koster, editors, Proceedings of the 10th International Network Optimization Conference, INOC 2022, Aachen, Germany, June 7-10, 2022. pages 1-6, OpenProceedings.org, 2022. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.