| Article ID: | iaor20032059 |
| Country: | United States |
| Volume: | 50 |
| Issue: | 5 |
| Start Page Number: | 810 |
| End Page Number: | 819 |
| Publication Date: | Sep 2002 |
| Journal: | Operations Research |
| Authors: | Mehrotra Sanjay, Owen Jonathan H. |
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.