The splittable flow arc set with capacity and minimum load constraints
Author(s)
Date
2013Source Title
Operations Research Letters
Print ISSN
0167-6377
Electronic ISSN
1872-7468
Publisher
Elsevier
Volume
41
Issue
5
Pages
556 - 558
Language
English
Type
ArticleItem Usage Stats
133
views
views
94
downloads
downloads
Abstract
We 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.
Keywords
Convex hullMinimum load constraints
Mixed integer knapsack set
Residual capacity inequalities
Splittable flow arc set
Minimum load
Mixed integer
Residual capacity
Splittable flows
Management science
Operations research
Computational geometry