Pages that link to "Item:Q652284"
From MaRDI portal
The following pages link to Improved strategies for branching on general disjunctions (Q652284):
Displaying 19 items.
- Improving branch-and-cut performance by random sampling (Q266414) (← links)
- Improved branching disjunctions for branch-and-bound: an analytic center approach (Q319920) (← links)
- Achieving MILP feasibility quickly using general disjunctions (Q336442) (← links)
- Practical strategies for generating rank-1 split cuts in mixed-integer linear programming (Q384805) (← links)
- Branching on nonchimerical fractionalities (Q439902) (← links)
- Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices (Q537960) (← links)
- Branching on general disjunctions (Q543420) (← links)
- Intermediate integer programming representations using value disjunctions (Q951104) (← links)
- Branching rules revisited (Q1886796) (← 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)
- Lower bounds on the size of general branch-and-bound trees (Q2687056) (← links)
- A two-stage stochastic integer programming approach to integrated staffing and scheduling with application to nurse management (Q2797463) (← links)
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs (Q2897292) (← links)
- Branching on split disjunctions (Q2928710) (← links)
- Technical Note—A Langrangian Algorithm for the Multiple Choice Integer Program (Q3220353) (← links)
- Compressing branch-and-bound trees (Q6086013) (← links)
- An abstract model for branch and cut (Q6589748) (← links)
