In this work we propose a primal heuristic to improve the branch-and-cut algorithm presented in for one of the ILP formulations of the RSA problem proposed in, namely, the model DSL-BF.
General information
Exposure date:octubre 2021
Issue date:2021
Document language:English
Event:IV Simposio Argentino de Informática Industrial e Investigación Operativa (SIIIO 2021) - JAIIO 50 (Modalidad virtual)
Origin:Sociedad Argentina de Informática e Investigación Operativa