Generating facets for the independence system
Author
Fouilhoux, P.
Labbé, M.
Mahjoub, A. R.
Yaman, H.
Date
2009Source Title
SIAM Journal on Discrete Mathematics
Print ISSN
0895-4801
Electronic ISSN
1095-7146
Publisher
Society for Industrial and Applied Mathematics
Volume
23
Issue
3
Pages
1484 - 1506
Language
English
Type
ArticleItem Usage Stats
107
views
views
114
downloads
downloads
Abstract
In this paper, we present procedures to obtain facet-defining inequalities for the independence system polytope. These procedures are defined for inequalities which are not necessarily rank inequalities. We illustrate the use of these procedures by der iving strong valid inequalities for the acyclic induced subgraph, triangle free induced subgraph, bipartite induced subgraph, and knapsack polytopes. Finally, we derive a new family of facet-defining ineq ualities for the independence system polytope by adding a set of edges to antiwebs.
Keywords
Independence system polytopeInteger programming
Polyhedral combinatorics
Independence system polytope
Lifting
Nonrank facets