Abstract
We study the use of binary variables in reformulating general mixed-integer linear programs. We show that binary reformulations result in problems for which almost all the binary variables replacing a general integer variable need to be explored during branching. We also give computational results on the performance of such reformulations in solving the mixed-integer programs, which support our theoretical results.
Original language | English (US) |
---|---|
Pages (from-to) | 810-819 |
Number of pages | 10 |
Journal | Operations Research |
Volume | 50 |
Issue number | 5 |
DOIs | |
State | Published - 2002 |
Keywords
- Integer: remodeling of general integer variables
- Programming
ASJC Scopus subject areas
- Computer Science Applications
- Management Science and Operations Research