Skip to main content

Increasing Solving Time in Subsequent Nodes During Strong Branching with Branch and Price




  • Mario Ruthmair
    Gurobi Staff Gurobi Staff

    Hi Tifaout,

    What exactly takes longer? Is it only the time to solve the LP relaxation that takes longer, or does it take a longer time to modify the model from one node to the next?

    Have you tried to only modify the bounds of the branching variables, and leave the rest of the preprocessing (setting other variable bounds to zero) to the solver? It could be that this is more efficient.

    Best regards,

  • Tifaout Almeftah
    First Comment
    First Question

    Hi Mario,

    I greatly appreciate your response!

    I've noticed that the most time-consuming part is solving the LP relaxation. Your advice was incredibly valuable. Specifically, I realized that adding the constraint "variable to branch on equals 1" (x = 1) directly into the model, rather than adjusting its lower and upper bounds to 1, significantly increases the model's complexity. This approach leads to a rapid increase in the number of variables, particularly as I'm employing a branch and price strategy. Hence, I observed the unusual behavior I initially mentioned.

    Based on this insight, I plan to modify and fine-tune my experiments. I aim to identify the most effective strategy for strong branching, particularly in evaluating candidate nodes. I'll consider using variable fixing to zero or allowing the preprocessing to handle it.

    Your guidance has been incredibly helpful, Mario. Thank you once again!

    Kind regards,



Please sign in to leave a comment.