ISSN:
1436-4646
Schlagwort(e):
Key words: set packing – polyhedral combinatorics – cutting planes – integer programming
;
Mathematics Subject Classification (2000): 90C10
Quelle:
Springer Online Journal Archives 1860-2000
Thema:
Informatik
,
Mathematik
Notizen:
Abstract. 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.
Materialart:
Digitale Medien
URL:
http://dx.doi.org/10.1007/PL00011381
Permalink