| Article ID: | iaor20013620 |
| Country: | Germany |
| Volume: | 88 |
| Issue: | 3 |
| Start Page Number: | 425 |
| End Page Number: | 450 |
| Publication Date: | Jan 2000 |
| Journal: | Mathematical Programming |
| Authors: | Weismantel R., Borndrfer R. |
| Keywords: | sets, graphs |
This paper is about set packing relaxations of combinatorial optimization problems associated with acyclic digraphs and linear orderings, cuts and multicuts, and set packings themselves. Families of inequalities that are valid for such a relaxation as well as the associated separation routines carry over to the problems under investigation.