Show simple item record

dc.contributor.authorAppleget, Jeffrey A.
dc.contributor.authorWood, R. Kevin
dc.date.accessioned2014-01-22T19:08:22Z
dc.date.available2014-01-22T19:08:22Z
dc.date.issued2000
dc.identifier.urihttp://hdl.handle.net/10945/38419
dc.description.abstractThis paper develops a new generalized-branching technique called "explicit constraint branching" (ECB) to improve the performance of branch-and-bound algorithms for solving mixed-integer programs (MIPs). ECB adds structure to a MIP, in the frm of auxiliary constraints and auxiliary integer variables, to allow branching on groups of (original) integer variables that would not otherwise be possible. Computational tests on three sets of real-world MIPs demonstrate that ECB often improves solution times over standard branch and bound, sometimes dramatically.en_US
dc.rightsdefined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.en_US
dc.titleExplicit-Constraint Branching for Solving Mixed-Integer Programsen_US
dc.typeArticleen_US
dc.contributor.departmentOperations Research (OR)
dc.subject.authorfacilities/equipment planning: capacity expansion; industries: electric; networks/graphs: applications, stochastic; programming: integer, algorithms, Benders decomposition, applications, stochastic.en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record