How Branch and Bound exploring nodes in intlinprog so fast?

1 view (last 30 days)
I've tried in Matlab 2016b the optimization toolbox function intlinprog, and what surprise me is that its branch-and-bound procedure explore nodes very fast! much faster than what I've coded by myself!? I've tried examples with same number of explored nodes, intlinprog seems always explore faster than my code. I'd like to know why it works so fast? is it using mex programming or something else? (I've tried pcode, but it can not get that speed) Is there anybody can share a branch-and-bound code on Matlab as fast as intlinprog?
Besides, is there any code for generating classical Cutting planes for mixed-integer optimization on Matlab? Otherwise, is it possible to pick out the cutting planes generated by intlinprog? Thanks a lot!

Answers (0)

Categories

Find more on 线性规划和混合整数线性规划 in Help Center and File Exchange

Products

Community Treasure Hunt

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

Start Hunting!