Yayınlanmış 1 Ocak 2009
| Sürüm v1
Dergi makalesi
Açık
A strong conic quadratic reformulation for machine-job assignment with controllable processing times
Oluşturanlar
- 1. Bilkent Univ, Dept Ind Engn, TR-06800 Ankara, Turkey
- 2. Univ Calif Berkeley, Dept Ind Engn & Operat Res, Berkeley, CA 94720 USA
Açıklama
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. (C) 2009 Elsevier B.V. All rights reserved.
Dosyalar
bib-51b66447-5dc9-4132-87b2-f19ced568e9b.txt
Dosyalar
(191 Bytes)
| Ad | Boyut | Hepisini indir |
|---|---|---|
|
md5:7dc410785ac8130ec6c5be95dba69afe
|
191 Bytes | Ön İzleme İndir |