Transitive packing
From MaRDI portal
Publication:4645940
DOI10.1007/3-540-61310-2_32zbMATH Open1415.90105OpenAlexW2912523842MaRDI QIDQ4645940FDOQ4645940
Authors: Rudolf Müller, Andreas S. Schulz 
Publication date: 11 January 2019
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-61310-2_32
Recommendations
Cites Work
- Title not available (Why is that?)
- Geometric algorithms and combinatorial optimization
- Title not available (Why is that?)
- Properties of vertex packing and independence system polyhedra
- A generalization of antiwebs to independence systems and their canonical facets
- A class of facet producing graphs for vertex packing polyhedra
- On the facial structure of set packing polyhedra
- On the cut polytope
- Set Partitioning: A survey
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
- On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
- On the 0,1 facets of the set covering polytope
- On the facial structure of the set covering polytope
- Facets and lifting procedures for the set covering polytope
- A cutting plane algorithm for a clustering problem
- The clique partitioning problem: Facets and patching facets
- Facets of the clique partitioning polytope
- Edmonds polytopes and a hierarchy of combinatorial problems
- The partition problem
- Corrigendum to our paper The ellipsoid method and its consequences in combinatorial optimization
- On Cutting Planes
- Facets of the Bipartite Subgraph Polytope
- On cutting-plane proofs in combinatorial optimization
- Title not available (Why is that?)
- On the acyclic subgraph polytope
- Generalizations of Cliques, Odd Cycles and Anticycles and Their Relation to Independence System Polyhedra
- Title not available (Why is that?)
- On the set covering polytope. II: Lifting the facets with coefficients in \(\{\) 0,1,2\(\}\)
- Covering, Packing and Knapsack Problems
- \((0,\pm 1)\) ideal matrices
- Balanced \(0,\pm 1\)-matrices, bicoloring and total dual integrality
- Title not available (Why is that?)
- The interval order polytope of a digraph
- Covers and packings in a family of sets
- Transitive packing
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (9)
- Transitive packing
- The packing property.
- A combinatorial study of partial order polytopes
- A class of web-based facets for the generalized vertex packing problem
- Tree-width and the Sherali-Adams operator
- A note on node packing polytopes on hypergraphs
- Transitive Packing: A Unifying Concept in Combinatorial Optimization
- Title not available (Why is that?)
- The partial constraint satisfaction problem: Facets and lifting theorems
This page was built for publication: Transitive packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645940)
