are ordered branching conditions for a search tree node available

Answered

Srinivas Subramanya Tamvada

January 05, 2021 12:57

• 
• 
• 

Hi

I want to know if the ordered branching conditions for a search tree node ( in a MIP search tree)   are available via the Java APIs.

Thanks!

0

• Official comment

  

  Simranjit Kaur

  • Gurobi Staff

  June 23, 2025 03:02 Edited

  This post is more than three 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 why not try our AI Gurobot?.
• 

  Jaromił Najman

  • Gurobi Staff

  January 06, 2021 10:51

  Hi Srinivas,

  Could you explain what you mean by ordered branching conditions?

  Best regards,
  Jaromił

  0
• 

  Srinivas Subramanya Tamvada

  January 06, 2021 11:23

  • 
  • 
  • 

  if the root node branches on binary variable  x1 to create 2 child nodes C1 and C2

  then C1 branches on binary variable y1 to create leafs C3 and C4

  I want to find out, at node C4, that it was created using  the branching conditions  x1=0 and y1=1

  0
• 

  Srinivas Subramanya Tamvada

  January 06, 2021 11:24

  • 
  • 
  • 

  also, it would be great if I knew the order in which variables were branched in order to create a leaf node. In the above example, the order was x1=0 and then y1=1

  0
• 

  Jaromił Najman

  • Gurobi Staff

  January 06, 2021 11:46

  Hi Srinivas,

  This information is not available from any API.

  Best regards,
  Jaromił

  0

Post is closed for comments.