Question about ConcurrentMIP
回答済みI understand that ConcurrentMIP lets the solver perform parallel searches along the branch and bound tree for a MIP problem. Suppose one such search finds an incumbent solution, meaning any branch that produces a worse solution can be cut off. So is there some kind of message-passing mechanism between the parallel searches where the incumbent results of one thread can benefit other threads as well?
-
正式なコメント
-
Gurobi Staff
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. -
-
-
As the documentation of ConcurrentMIP says
When the parameter is set to value
n, the MIP solver performsnindependent MIP solves in parallel, with different parameter settings for each. Optimization terminates when the first solve completes.So, the MIPs are solved independently. There is no such communication you described.
0 -
-
Thank you for the answer. Do you think implementing such a message-passing mechanism makes sense as a new feature request for a future release? It might help to improve the performance of the solver.
0 -
-
-
This is something our Dev team is aware of but it is more complicated to implement than one might imagine. We will keep improving our code, though, and this feature might be part of the solver in a future release.
0 -
投稿コメントは受け付けていません。
コメント
4件のコメント