- Experiments with Branching using General Disjunctions Ashutosh Mahajan (asm4lehigh.edu) Ted Ralphs (tedlehigh.edu) Abstract: Branching is an important component of the branch-and-cut algorithm for solving mixed integer linear programs. Most solvers branch by imposing a disjunction of the form$x_i \leq k \vee x_i \geq k+1$'' for some integer $k$ and some integer-constrained variable $x_i$. A generalization of this branching scheme is to branch by imposing a more general disjunction of the form $\pi x \leq \pi_0 \vee \pi x \geq \pi_0+1$'', where $\pi,\pi_0$ are integral. In this paper, we discuss the formulation of two optimization models for selecting such a branching disjunction and then describe methods of solution using a standard MILP solver. We report on computational experiments carried out to study the effects of branching on such disjunctions. Keywords: Integer Programming, Branch and Cut, Branching Disjunction, Generalized Branching Category 1: Integer Programming Citation: Technical Report, COR@L Lab, Lehigh University Download: [PDF]Entry Submitted: 06/23/2008Entry Accepted: 06/24/2008Entry Last Modified: 09/18/2008Modify/Update this entry Visitors Authors More about us Links Subscribe, Unsubscribe Digest Archive Search, Browse the Repository Submit Update Policies Coordinator's Board Classification Scheme Credits Give us feedback Optimization Journals, Sites, Societies Optimization Online is supported by the Mathematical Programming Society and by the Optimization Technology Center.