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

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Youcef Magnouche' in GoogleThis author has not been identified. Look up 'Sébastien Martin' in GoogleThis author has not been identified. Look up 'Jérémie Leguay' in GoogleThis author has not been identified. Look up 'Francesco De Pellegrini' in GoogleThis author has not been identified. Look up 'Rachid Elazouzi' in GoogleThis author has not been identified. Look up 'Cédric Richier' in Google

runs on WebDSL