Using Branch and Bound Algorithm to solve Discrete Binary Quadratic Programming (QP) problem
5 vues (au cours des 30 derniers jours)
Afficher commentaires plus anciens
Dear all,
Can I use the branch and bound algorithm to solve my problem ((Discrete Binary Quadratic Programming (QP) problem)) in Matlab, if yes, what is the name of function (solver) that I can use in Matlab??
if no, Does GA is an effective algorithm that can I use to solve my problem?
please send me useful documentation for this
0 commentaires
Réponse acceptée
Matt J
le 8 Nov 2020
Modifié(e) : Matt J
le 8 Nov 2020
Can I use the branch and bound algorithm to solve my problem ((Discrete Binary Quadratic Programming (QP) problem)) in Matlab
No, except in the special case where your QP is also an LP. In that case, use intlinprog.
if no, Does GA is an effective algorithm that can I use to solve my problem?
The only way to find out is to try.
2 commentaires
Plus de réponses (0)
Voir également
Catégories
En savoir plus sur Quadratic Programming and Cone Programming dans Help Center et File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!