Show simple item record

dc.contributor.authorYaman, H.en_US
dc.date.accessioned2016-02-08T09:36:25Z
dc.date.available2016-02-08T09:36:25Z
dc.date.issued2013en_US
dc.identifier.issn0167-6377
dc.identifier.urihttp://hdl.handle.net/11693/20846
dc.description.abstractWe study the convex hull of the splittable flow arc set with capacity and minimum load constraints. This set arises as a relaxation of problems where clients have demand for a resource that can be installed in integer amounts and that has capacity limitations and lower bounds on utilization. We prove that the convex hull of this set is the intersection of the convex hull of the set with a capacity constraint and the convex hull of the set with a minimum load constraint.en_US
dc.language.isoEnglishen_US
dc.source.titleOperations Research Lettersen_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/j.orl.2013.07.005en_US
dc.subjectConvex hullen_US
dc.subjectMinimum load constraintsen_US
dc.subjectMixed integer knapsack seten_US
dc.subjectResidual capacity inequalitiesen_US
dc.subjectSplittable flow arc seten_US
dc.subjectMinimum loaden_US
dc.subjectMixed integeren_US
dc.subjectResidual capacityen_US
dc.subjectSplittable flowsen_US
dc.subjectManagement scienceen_US
dc.subjectOperations researchen_US
dc.subjectComputational geometryen_US
dc.titleThe splittable flow arc set with capacity and minimum load constraintsen_US
dc.typeArticleen_US
dc.departmentDepartment of Industrial Engineering
dc.citation.spage556en_US
dc.citation.epage558en_US
dc.citation.volumeNumber41en_US
dc.citation.issueNumber5en_US
dc.identifier.doi10.1016/j.orl.2013.07.005en_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