Branch-and-Benders-cut algorithm for the weighted coflow completion time minimization problem

From MaRDI portal

Jump to:navigation, search

DOI10.48786/INOC.2022.14MaRDI QIDQ6908183zbMATH OpenFDO

Authors Youcef Magnouche, Sébastien Martin, Jérémie Leguay, Francesco de Pellegrini, Rachid El-Azouzi, Cedric Richier

Publication date 31 October 2025

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11)

This page was built for publication: Branch-and-Benders-cut algorithm for the weighted coflow completion time minimization problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6908183)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Branch-and-Benders-cut_algorithm_for_the_weighted_coflow_completion_time_minimization_problem&oldid=75592153"