Transitive packing

10Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper is intended to give a concise understanding of the facial structure of previously separately investigated polyhedra. We introduce the notion of transitive packing and the transitive packing polytope and give cutting plane proofs for huge classes of valid inequalities of this polytope. We introduce generalized cycle, generalized clique, generalized antihole, generalized antiweb, generalized web, and odd partition inequalities. These classes subsume several known classes of valid inequalities for several of the special cases but also give many new inequalities for several others. For some of the classes we also prove a nontrivial lower bound for their Chvátal rank. Finally, we relate the concept of transitive packing to generalized (set) packing and covering as well as to balanced and ideal matrices.

Cite

CITATION STYLE

APA

Müller, R., & Schulz, A. S. (1996). Transitive packing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1084, pp. 430–444). Springer Verlag. https://doi.org/10.1007/3-540-61310-2_32

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free