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.
- Integer: remodeling of general integer variables
ASJC Scopus subject areas
- Computer Science Applications
- Management Science and Operations Research