Does intlinprog use cuts during its Branch and Bound Algorithm?

6 views (last 30 days)
I´m currently working with the Function intlinprog from the optimization toolbox and wonder, if it uses cuts during its Branch and Bound Algorithm? I read the descriptions of the function https://www.mathworks.com/help/optim/ug/intlinprog.html and https://www.mathworks.com/help/optim/ug/mixed-integer-linear-programming-algorithms.html and i am still not sure, if it uses cuts during its BnB. There is a mention of cuts and even an option to tell the function what cuts should be used, but does that only apply to cuts for preprocessing? If i had to guess, i would say that it doesn´t use cuts in BnB, hence it is called Branch and Bound and not Branch and Cut, but i´m just not entirely certain of it. I´m fairly new to MILP, so if my questions sounds somewhat silly in face of the clear mention of BnB in intlinprog, then that´s on me, but i don´t get why one wouldn´t use cuts in BnB? Another question would be, if that function can be made to use multiple CPU cores?
I hope someone can give me some clarity in that regard. Thanks in advance

Accepted Answer

Bruno Luong
Bruno Luong on 6 Aug 2022
CutMaxIterations: Number of passes through all cut generation methods before entering the branch-and-bound phase,
It seems pretty clear to me
  2 Comments
Alan Weiss
Alan Weiss on 7 Aug 2022
You can see a fairly complete algorithm description of intlinprog here.
Alan Weiss
MATLAB mathematical toolbox documentation

Sign in to comment.

More Answers (0)

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!