Polyhedral results on single node variable upper-bound flow models with allowed configurations |
| |
Authors: | Tams Kis |
| |
Institution: | aComputer and Automation Research Institute, Hungarian Academy of Sciences, Kende utca 13-17, 1111 Budapest, Hungary |
| |
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 , where ρ is one of , = or , 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ρ(Z) for each relation ρ is provided, along with polynomial time separation algorithms. Applications in scheduling and network design are also discussed. |
| |
Keywords: | Variable upper-bound flow model Polyhedral combinatorics Integer programming Network design |
本文献已被 ScienceDirect 等数据库收录! |
|