Transitive packing

DOI10.1007/3-540-61310-2_32MaRDI QIDQ4645940zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

packing problemvalid inequalityindependence systemclique inequalityextended graph

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39) Integer programming (90C10)

Recommendations

• Transitive Packing: A Unifying Concept in Combinatorial Optimization
• A note on node packing polytopes on hypergraphs
• Mode packing and perfect graphs
• New facets for the set packing polytope
• A class of web-based facets for the generalized vertex packing problem

Cites work

• scientific article; zbMATH DE number 4191655 (Why is no real title available?)
• scientific article; zbMATH DE number 3888925 (Why is no real title available?)
• scientific article; zbMATH DE number 3902393 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 1263289 (Why is no real title available?)
• scientific article; zbMATH DE number 1263290 (Why is no real title available?)
• A class of facet producing graphs for vertex packing polyhedra
• A cutting plane algorithm for a clustering problem
• A generalization of antiwebs to independence systems and their canonical facets
• Balanced \(0,\pm 1\)-matrices, bicoloring and total dual integrality
• Corrigendum to our paper The ellipsoid method and its consequences in combinatorial optimization
• Covering, Packing and Knapsack Problems
• Covers and packings in a family of sets
• Edmonds polytopes and a hierarchy of combinatorial problems
• Facets and lifting procedures for the set covering polytope
• Facets of the Bipartite Subgraph Polytope
• Facets of the clique partitioning polytope
• Generalizations of Cliques, Odd Cycles and Anticycles and Their Relation to Independence System Polyhedra
• Geometric algorithms and combinatorial optimization
• On Cutting Planes
• On cutting-plane proofs in combinatorial optimization
• On the 0,1 facets of the set covering polytope
• On the acyclic subgraph polytope
• On the cut polytope
• On the facial structure of set packing polyhedra
• On the facial structure of the set covering polytope
• On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
• On the set covering polytope. II: Lifting the facets with coefficients in \(\{\) 0,1,2\(\}\)
• Properties of vertex packing and independence system polyhedra
• Set Partitioning: A survey
• The clique partitioning problem: Facets and patching facets
• The interval order polytope of a digraph
• The partition problem
• Transitive packing
• \((0,\pm 1)\) ideal matrices
• \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts

Cited in

(9)

• A note on node packing polytopes on hypergraphs
• Transitive Packing: A Unifying Concept in Combinatorial Optimization
• A class of web-based facets for the generalized vertex packing problem
• The packing property.
• The partial constraint satisfaction problem: Facets and lifting theorems
• A combinatorial study of partial order polytopes
• Transitive packing
• scientific article; zbMATH DE number 874532 (Why is no real title available?)
• Tree-width and the Sherali-Adams operator

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)