| Article ID: | iaor20073117 |
| Country: | Netherlands |
| Volume: | 35 |
| Issue: | 1 |
| Start Page Number: | 36 |
| End Page Number: | 44 |
| Publication Date: | Jan 2007 |
| Journal: | Operations Research Letters |
| Authors: | Mak Vicky |
In this paper, using the Unconstrained Shape Matrix Optimization Problem as a test bed, we investigate various aspects of variable aggregation and disaggregation for a class of integer programs that contains binary expansion. We present theoretical and numerical results, and propose an iterative algorithm for exact solutions.