Time limit
Related to #384
Hello,
I'm wondering if there is a way to set a time limit for solver (e.g., if "default_optimizer" => CPLEX.Optimizer) when using coluna to solve the MIP problem?
Thank you very much!
Best, Yue
Hi,
You can indeed define a time limit for your subsolver using an optimizer_with_attributes from JuMP :
https://github.com/atoptima/Coluna.jl/blob/7a7d72688e3b326d0ad7273b38cd5adb828a9785/test/optimizer_with_attributes_test.jl#L13
These parameters will be applied to all subsolvers.
Hi,
You can indeed define a time limit for your subsolver using an
optimizer_with_attributesfrom JuMP :https://github.com/atoptima/Coluna.jl/blob/7a7d72688e3b326d0ad7273b38cd5adb828a9785/test/optimizer_with_attributes_test.jl#L13
These parameters will be applied to all subsolvers.
Thank you for the reply! Is this setting restrict only the execution time for sub-problem solving or the whole execution time? I think this setting could only restrict the execution time for sub-problem... In fact, I would like to restrict the whole problem solving time, sorry for not being clear. Do you know if there is a way to restrict it?
Best, Yue
Yes, it restricts the execution time for each subsolver call.
Unfortunately, there is no way to define a time limit on the whole execution of Coluna at the moment. It will be available in the next few months.
However, you can define a limit on the number of nodes explored (parameter maxnumnodes in https://atoptima.github.io/Coluna.jl/latest/dev/algorithms/#Coluna.Algorithm.TreeSearchAlgorithm).
Yes, it restricts the execution time for each subsolver call. Unfortunately, there is no way to define a time limit on the whole execution of Coluna at the moment. It will be available in the next few months. However, you can define a limit on the number of nodes explored (parameter
maxnumnodesin https://atoptima.github.io/Coluna.jl/latest/dev/algorithms/#Coluna.Algorithm.TreeSearchAlgorithm).
Thank you! I'm looking forward to it! For this moment I'll try to define the limit on the number of nodes explored :)
Best, Yue