Find out how to access previewonly content
, Volume 45, Issue 1, pp 97108
First online:
A generalization of antiwebs to independence systems and their canonical facets
 Monique LaurentAffiliated withCNET PAATIM
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
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 Title
 A generalization of antiwebs to independence systems and their canonical facets
 Journal

Mathematical Programming
Volume 45, Issue 13 , pp 97108
 Cover Date
 198908
 DOI
 10.1007/BF01589098
 Print ISSN
 00255610
 Online ISSN
 14364646
 Publisher
 SpringerVerlag
 Additional Links
 Topics
 Keywords

 0, 1 integer programming
 independence system
 facet
 antiweb
 Industry Sectors
 Authors

 Monique Laurent ^{(1)}
 Author Affiliations

 1. CNET PAATIM, 3840 rue de général Leclerc, 92131, Issy Les Moulineaux, France