Mathematical Programming

, Volume 45, Issue 1, pp 97-108

First online:

A generalization of antiwebs to independence systems and their canonical facets

  • Monique LaurentAffiliated withCNET PAA-TIM

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


We consider independence system polytopes, i.e. polytopes whose extreme points are the incidence vectors of the sets of an independence system. We first give a sufficient condition for recognizing Boolean facets. Then, the notion of antiweb introduced by Trotter for graphs is generalized to independence systems and used for obtaining canonical facets of the associated polytopes. We also point out how our results relate with known ones for knapsack, set covering and matroid polytopes.

Key words

0, 1 integer programming independence system facet antiweb