Experimental Results on Using General Disjunctions in Branch-and-Bound for General-Integer Linear Programs

Authors:
Jonathan H. Owen;Sanjay Mehrotra
Affiliations:
Department of Industrial Engineering and Management Sciences, Robert R. McCormick School of Engineering, Northwestern University, Evanston, Illinois 60208, USA;Department of Industrial Engineering and Management Sciences, Robert R. McCormick School of Engineering, Northwestern University, Evanston, Illinois 60208, USA
Venue:
Computational Optimization and Applications
Year:
2001

Citing 4
Cited 5

The generalized basis reduction algorithm

Mathematics of Operations Research
Mixed 0-1 programming by lift-and-project in a branch-and-cut framework

Management Science
Cutting planes for integer programs with general integer variables

Mathematical Programming: Series A and B - Special issue on computational integer programming
Gomory cuts revisited

Operations Research Letters

Information-theoretic approaches to branching in search

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
On the Complexity of Selecting Disjunctions in Integer Programming

SIAM Journal on Optimization
Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices

Journal of Global Optimization
Information-theoretic approaches to branching in search

Discrete Optimization
Achieving MILP feasibility quickly using general disjunctions

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Typical implementations of branch-and-bound for integer linear programs choose to branch on single variables. In this paper we explore the use of general disjunctions for branching when solving linear programs with general-integer variables. We give computational results that show that the size of the enumeration tree can be greatly reduced by branching on such disjunctions rather than on single variables.