Optimization Online


Decomposition Branching for Mixed Integer Programming

Baris Yildiz (byildiz***at***ku.edu.tr)
Boland Natashia (natashia.boland***at***gmail.com)
Martin Savelsbergh (martin.savelsbergh***at***isye.gatech.edu)

Abstract: We introduce a novel and powerful approach for solving certain classes of mixed integer programs (MIPs): decomposition branching. Two seminal and widely used techniques for solving MIPs, branch-and-bound and decomposition, form its foundation. Computational experiments with instances of a weighted set covering problem and a regionalized p-median facility location problem with assignment range constraints demonstrate its efficacy: it explores far fewer nodes and can be orders of magnitude faster than a commercial solver.


Category 1: Integer Programming ((Mixed) Integer Linear Programming )


Download: [PDF]

Entry Submitted: 08/30/2018
Entry Accepted: 08/30/2018
Entry Last Modified: 08/30/2018

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 Optimization Society