What algorithm does gurobi use internally to solve mixed integer programming problems?
回答済みhi,Professor
I recently wrote a Benders decomposition algorithm for mixed integer programming problems, but the convergence rate of the upper and lower bounds is too slow, and it is far less than solving directly with gurobi. So I want to know the algorithm inside gurobi, and how to view gurobi's iterative intermediate results in detail in matlab.
thanks!!!
0
-
正式なコメント
This post is more than two years old. Some information may not be up to date. For current information, please check the Gurobi Documentation or Knowledge Base. If you need more help, please create a new post in the community forum, or try Gurobot, our chatbot interface offering instant, expert-level support. -
Please check the answers in this post.
0
投稿コメントは受け付けていません。
コメント
2件のコメント