| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1143227 | Operations Research Letters | 2007 | 9 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Vicky Mak,