| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1142838 | Operations Research Letters | 2009 | 5 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
M. Seli̇m Aktürk, Alper Atamtürk, Si̇nan Gürel,