Towards learning integral strategy of branch and bound

TitreTowards learning integral strategy of branch and bound
Publication TypeConference Paper
Year of Publication2017
AuthorsKabbaj, MM, A. Afia, E
Conference NameInternational Conference on Multimedia Computing and Systems -Proceedings

Branch and bound is the preferred algorithm used for solving MILP problems. It involves two fundamental strategies that are node selection strategy and branching strategy. Whereas the learning literature has been focused in dealing with just one strategy on the same time, we design a two-in-one strategy of branch and bound algorithm regarding the fact that are intuitively dependent. To do so, we apply the well-known SVM algorithm to the well-known set of problems MIPLIP. © 2016 IEEE.




Location map

Suivez-nous sur




Avenue Mohammed Ben Abdallah Regragui, Madinat Al Irfane, BP 713, Agdal Rabat, Maroc

Résultat de recherche d'images pour "icone fax" Télécopie : (+212) 5 37 77 72 30

    Compteur de visiteurs:354,382
    Education - This is a contributing Drupal Theme
    Design by WeebPal.