Pages that link to "Item:Q2235165"

The following pages link to Further results on an abstract model for branching and its application to mixed integer programming (Q2235165):

Displaying 13 items.

• An abstract model for branching and its application to mixed integer programming (Q1683695) (← links)
• How important are branching decisions: fooling MIP solvers (Q1785358) (← links)
• Optimal decision trees for feature based parameter tuning: integer programming model and VNS heuristic (Q1791966) (← links)
• Projection heuristics for binary branchings between sum and product (Q2118310) (← links)
• An abstract model for branch-and-cut (Q2164714) (← links)
• Information-based branching schemes for binary linear mixed integer problems (Q2267352) (← links)
• Faster MIP solutions via new node selection rules (Q2270439) (← links)
• On learning and branching: a survey (Q2408515) (← links)
• Improving strong branching by domain propagation (Q2513744) (← links)
• Early estimates of the size of branch-and-bound trees (Q2892274) (← links)
• Predicting the solution time of branch-and-bound algorithms for mixed-integer programs (Q2899130) (← links)
• An abstract model for branch and cut (Q6589748) (← links)
• Enabling research through the SCIP Optimization Suite 8.0 (Q6601379) (← links)