Optimization Online


Information-Based Branching Schemes for Binary Linear Mixed Integer Problems

Fatma Kilinc-Karzan (fkilinc***at***gatech.edu)
George Nemhauser (gnemhaus***at***isye.gatech.edu)
Martin Savelsbergh (mwps***at***isye.gatech.edu)

Abstract: Branching variable selection can greatly a ffect the eff ectiveness and efficiency of a branch-and- bound algorithm. Traditional approaches to branching variable selection rely on estimating the eff ect of the candidate variables on the objective function. We propose an approach which is empowered by exploiting the information contained in a family of fathomed subproblems, collected beforehand from an incomplete branch-and-bound tree. In particular, we use this information to defi ne new branching rules that reduce the risk of incurring inappropriate branchings. We provide computational results that demonstrate the effectiveness of the new branching rules on various benchmark instances.

Keywords: branch and bound; variable selection; computational algorithms

Category 1: Integer Programming (0-1 Programming )


Download: [PDF]

Entry Submitted: 03/23/2009
Entry Accepted: 03/23/2009
Entry Last Modified: 12/02/2009

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society