The following pages link to Branching on general disjunctions (Q543420):
Displaying 12 items.
- Improved branching disjunctions for branch-and-bound: an analytic center approach (Q319920) (← links)
- Achieving MILP feasibility quickly using general disjunctions (Q336442) (← links)
- Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices (Q537960) (← links)
- Improved strategies for branching on general disjunctions (Q652284) (← links)
- Computing deep facet-defining disjunctive cuts for mixed-integer programming (Q847850) (← links)
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II (Q2061899) (← links)
- An abstract model for branch-and-cut (Q2164714) (← links)
- Information-based branching schemes for binary linear mixed integer problems (Q2267352) (← links)
- Improving strong branching by domain propagation (Q2513744) (← links)
- A Two-Stage Stochastic Integer Programming Approach to Integrated Staffing and Scheduling with Application to Nurse Management (Q2797463) (← links)
- (Q5092485) (← links)
- A study of lattice reformulations for integer programming (Q6047692) (← links)
