set packing;
polyhedral combinatorics;
cutting planes;
integer programming;
D O I:
10.1007/PL00011381
中图分类号:
TP31 [计算机软件];
学科分类号:
081202 ;
0835 ;
摘要:
This paper is bout 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.