Originally posted by: SystemAdmin

Hello,

I am currently solving a MIP problem and I want to solve it using the branch and bound algorithm. As far as I know cplex by default is using the branch & cut algorithm. Can anyone help me how to enable the branch and bound algorithm in a java environment?

Thank you
#CPLEXOptimizers
#DecisionOptimization

Originally posted by: SystemAdmin

Assuming that you are using CPLEX 11.0 or a later version, CPLEX will use the 'Dynamic search' algorithm by default. If you would like to force CPLEX to instead use pure 'Branch and Cut' then you will need to set the MIPSearch parameter (CPX_PARAM_MIPSEARCH in the callable library) to 1. Given that you are trying to simulate 'Branch and Bound' and not 'Branch and Cut', you will need to disable the cut generation process and the simplest way to do this will be to set the CutsFactor parameter (CPX_PARAM_CUTSFACTOR in the callable library) to 1.0.

The following doc links can help elaborate a bit more on the available algorithms:

http://publib.boulder.ibm.com/infocenter/cosinfoc/v12r3/index.jsp?topic=%2Filog.odms.cplex.help%2Fhtml%2Frefcallablelibrary%2Fhtml%2Fbranch.html

http://publib.boulder.ibm.com/infocenter/cosinfoc/v12r3/index.jsp?topic=%2Filog.odms.cplex.help%2FContent%2FOptimization%2FDocumentation%2FOptimization_Studio%2F_pubskel%2Fps_usrmancplex1814.html
#CPLEXOptimizers
#DecisionOptimization

Originally posted by: SystemAdmin

Nice, thanks a lot :)
#CPLEXOptimizers
#DecisionOptimization