| Article ID: | iaor20102953 |
| Volume: | 37 |
| Issue: | 3 |
| Start Page Number: | 187 |
| End Page Number: | 191 |
| Publication Date: | May 2009 |
| Journal: | Operations Research Letters |
| Authors: | Atamtrk Alper, Grel Sinan, Aktrk M Selim |
We describe a polynomial-size conic quadratic reformulation for a machine-job assignment problem with separable convex cost. Because the conic strengthening is based only on the objective of the problem, it can also be applied to other problems with similar cost functions. Computational results demonstrate the effectiveness of the conic reformulation.