Transitive packing

Rudolf Müller, Andreas S. Schulz

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

10 Scopus citations

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.

Original languageEnglish
Title of host publicationInteger Programming and Combinatorial Optimization - 5th International IPCO Conference, 1996 Proceedings
EditorsWilliam H. Cunningham, S.Thomas McCormick, Maurice Queyranne
PublisherSpringer Verlag
Pages430-444
Number of pages15
ISBN (Print)3540613102, 9783540613107
DOIs
StatePublished - 1996
Externally publishedYes
Event5th International Conference Integer Programming and Combinatorial Optimization, IPCO 1996 - Vancouver, Canada
Duration: 3 Jun 19965 Jun 1996

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1084
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference5th International Conference Integer Programming and Combinatorial Optimization, IPCO 1996
Country/TerritoryCanada
CityVancouver
Period3/06/965/06/96

Fingerprint

Dive into the research topics of 'Transitive packing'. Together they form a unique fingerprint.

Cite this