Rudolf Müller, Andreas S. Schulz  Home/Search
Context
Related
| mit.edu/schulz/www/ms99.ps Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: mit.edu/schulz/www...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper attempts to give a better understanding of the facial structure of previously separately investigated polyhedra. It introduces the notion of transitive packing and the transitive packing polytope. Polytopes that turn out to be special cases of the transitive packing polytope are, among others, the node packing polytope, the acyclic subdigraph polytope, the bipartite subgraph polytope, the planar subgraph polytope, the clique partitioning polytope, the partition polytope, the... (Update)
Similar documents based on text: More All
0.7: Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube - Eisenbrand, Schulz (1999) (Correct)
0.2: Polytopes and Scheduling - Schulz (1996) (Correct)
0.2: The Interval Order Polytope of a Digraph - Müller, Schulz (1995) (Correct)
BibTeX entry: (Update)
@misc{ ller-transitive,
author = "Rudolf Müller and Andreas S. Schulz",
title = "Transitive Packing: A Unifying Concept in Combinatorial Optimization",
url = "citeseer.ist.psu.edu/405660.html" }
Citations (may not include all citations):717 Theory of Linear and Integer Programming (context) - Schrijver - 1986
518 Integer and Combinatorial Optimization (context) - Nemhauser, Wolsey - 1988
245 Graphs and Hypergraphs (context) - Berge - 1973
84 Combinatorial Optimization (context) - Cook, Cunningham et al. - 1998
46 the facial structure of set packing polyhedra (context) - Padberg - 1973
33 Mathematical Programming (context) - Barahona, Mahjoub et al. - 1986
29 Set partitioning: A survey (context) - Balas, Padberg - 1976
23 Discrete Applied Mathematics (context) - Gallo, Longo et al. - 1993
22 Properties of vertex packing and independence system polyhed.. (context) - Nemhauser, Jr - 1974
18 Alpha--balanced graphs and matrices and GF (context) - Truemper - 1982
13 A class of facet producing graphs for vertex packing polyhed.. (context) - Jr - 1975
12 Annals of Discrete Mathematics (context) - Padberg, packing et al. - 1979
12 Polytopes and Scheduling - Schulz - 1996
11 Facets of the bipartite subgraph polytope (context) - Barahona, Grtschel et al. - 1985
11 Balanced matrices - Conforti, Cornujols et al. - 1994
[Article contains additional citations not shown here]
Documents on the same site (http://web.mit.edu/schulz/www/publications.html): More
ε-Optimization Schemes and L-Bit Precision.. - Orlin, Schulz, Sengupta (2000) (Correct)
The Power of alpha-Points in Preemptive Single Machine.. - Schulz, Skutella (2000) (Correct)
The Complexity of Generic Primal Algorithms for Solving.. - Schulz, Weismantel (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC