I want to solve an integer programming problem using the branch and bound method, but I'm having trouble finding the programming code. From what I saw, almost all algorithms use it for traveling salesman problems or job assignment cases. I need the branch and bound algorithm code to solve the problem of integer programming for optimization cases, with the aim of maximization or minimization. Does anyone have a source regarding branch and bound code for the optimization case? Or can anyone suggest where I can find the code? If anyone has it, please let me know. Any programming language doesn't matter as long as it can solve the problem of maximization or minimization in integer programming problems. Thanks.
Add a comment
|
3 Answers
$\begingroup$
$\endgroup$
There are several open-source software packages that use branch-and-bound to solve integer programming, for example:
$\begingroup$
$\endgroup$
Depending on the type of your MIP, there are numerous open-source options:
All of the above: SCIP (free for academics)
$\begingroup$
$\endgroup$
If you want to work inside Excel (or LibreOffice), you might look at OpenSolver. Google's OR-Tools includes the CBC solver and the option to use GLPK, SCIP or Gurobi. (Gurobi is commercial software with a free academic license.)
