Show simple item record

dc.contributor.authorAktürk, M. S.en_US
dc.contributor.authorAtamtürk, A.en_US
dc.contributor.authorGürel, S.en_US
dc.date.accessioned2016-02-08T10:04:26Z
dc.date.available2016-02-08T10:04:26Z
dc.date.issued2009en_US
dc.identifier.issn0167-6377
dc.identifier.urihttp://hdl.handle.net/11693/22764
dc.description.abstractWe 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.en_US
dc.language.isoEnglishen_US
dc.source.titleOperations Research Lettersen_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/j.orl.2008.12.009en_US
dc.subjectConic quadratic integer programmingen_US
dc.subjectSeparable convex functionsen_US
dc.subjectComputational resultsen_US
dc.subjectConic quadratic integer programmingen_US
dc.subjectConic reformulationsen_US
dc.subjectControllable processing timeen_US
dc.subjectDynamic programmingen_US
dc.subjectInteger programmingen_US
dc.titleA strong conic quadratic reformulation for machine-job assignment with controllable processing timesen_US
dc.typeArticleen_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.citation.spage187en_US
dc.citation.epage191en_US
dc.citation.volumeNumber37en_US
dc.citation.issueNumber3en_US
dc.identifier.doi10.1016/j.orl.2008.12.009en_US
dc.publisherElsevieren_US
dc.identifier.eissn1872-7468


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record