Improved strategies for branching on general disjunctions
From MaRDI portal
(Redirected from Publication:652284)
Recommendations
Cites work
- Branching on general disjunctions
- Disjunctive Programming
- Experimental results on using general disjunctions in branch-and-bound for general-integer linear programming
- scientific article; zbMATH DE number 1775383 (Why is no real title available?)
- scientific article; zbMATH DE number 3373541 (Why is no real title available?)
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- Optimizing over the split closure
- Reduce-and-Split cuts: improving the performance of mixed-integer Gomory cuts
Cited in
(27)- Branching rules revisited
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II
- An abstract model for branch-and-cut
- Information-based branching schemes for binary linear mixed integer problems
- Improving branch-and-cut performance by random sampling
- Lower bounds on the size of general branch-and-bound trees
- A two-stage stochastic integer programming approach to integrated staffing and scheduling with application to nurse management
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- Branching on split disjunctions
- On the complexity of selecting disjunctions in integer programming
- Improved branching disjunctions for branch-and-bound: an analytic center approach
- Technical Note—A Langrangian Algorithm for the Multiple Choice Integer Program
- Achieving MILP feasibility quickly using general disjunctions
- Verzweigungsstrategien in branch and bound-algorithmen für gemischt-ganzzahlige lineare 0-1-optimierungsanfgaben
- Practical strategies for generating rank-1 split cuts in mixed-integer linear programming
- Branching on nonchimerical fractionalities
- Exploring the numerics of branch-and-cut for mixed integer linear optimization
- Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices
- Branching on general disjunctions
- Branching on multi-aggregated variables
- Experimental results on using general disjunctions in branch-and-bound for general-integer linear programming
- Compressing branch-and-bound trees
- An abstract model for branch and cut
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II
- Compressing branch-and-bound trees
- A novel dual-decomposition method for non-convex two-stage stochastic mixed-integer quadratically constrained quadratic problems
- Intermediate integer programming representations using value disjunctions
This page was built for publication: Improved strategies for branching on general disjunctions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q652284)
