Polyhedral results on single node variable upper-bound flow models with allowed configurations

Authors:
TamáS Kis
Affiliations:
Computer and Automation Research Institute, Hungarian Academy of Sciences, Kende utca 13-17, 1111 Budapest, Hungary
Venue:
Discrete Optimization
Year:
2006

Citing 3
Cited 0

Integer and combinatorial optimization

Integer and combinatorial optimization
Cutting planes in integer and mixed integer programming

Discrete Applied Mathematics
A branch-and-cut algorithm for scheduling of projects with variable-intensity activities

Mathematical Programming: Series A and B

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we investigate the convex hull of single node variable upper-bound flow models with allowed configurations. Such a model is defined by a set X"@r(Z)={(x,z)@?R^nxZ|@?"j"="1^nx"j@rd,0==, and Z@?{0,1}^n consists of the allowed configurations. We consider the case when Z consists of affinely independent vectors. Under this assumption, a characterization of the non-trivial facets of the convex hull of X"@r(Z) for each relation @r is provided, along with polynomial time separation algorithms. Applications in scheduling and network design are also discussed.