Experimental results on using general disjunctions in branch-and-bound for general-integer linear programming

DOI10.1023/A:1011207119557zbMath0983.90044OpenAlexW1562114180MaRDI QIDQ5947148

Sanjay Mehrotra, Jonathan H. Owen

Publication date: 7 April 2002

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1011207119557

zbMATH Keywords

integer programmingbranch and bounddisjunctions

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (12)

Improved branching disjunctions for branch-and-bound: an analytic center approach ⋮ Achieving MILP feasibility quickly using general disjunctions ⋮ Compressing branch-and-bound trees ⋮ Information-theoretic approaches to branching in search ⋮ Improved strategies for branching on general disjunctions ⋮ Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices ⋮ Branching on general disjunctions ⋮ Information-based branching schemes for binary linear mixed integer problems ⋮ Unnamed Item ⋮ A Two-Stage Stochastic Integer Programming Approach to Integrated Staffing and Scheduling with Application to Nurse Management ⋮ Improving strong branching by domain propagation ⋮ Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II

This page was built for publication: Experimental results on using general disjunctions in branch-and-bound for general-integer linear programming