Fouilhoux, P.Labbé, M.Mahjoub, A. R.Yaman, H.2016-02-082016-02-0820090895-4801http://hdl.handle.net/11693/22557In 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.EnglishIndependence system polytopeInteger programmingPolyhedral combinatoricsIndependence system polytopeLiftingNonrank facetsArticle10.1137/0706959881095-7146