Transitive Packing: A Unifying Concept in Combinatorial Optimization

DOI10.1137/S1052623499363256MaRDI QIDQ4785885zbMATH OpenFDO

Authors Rudolf Müller, Andreas S. Schulz

Publication date 5 January 2003

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S1052623499363256

zbMATH Keywords

\(0/1\)-polytopecombinatorial optimizationGomory-Chvátal cutindependence systempolyhedral combinatoricstransitive packing

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Transitive packing
• A note on node packing polytopes on hypergraphs
• Mode packing and perfect graphs
• scientific article; zbMATH DE number 1263289
• Cones of Matrices and Set-Functions and 0–1 Optimization

Cited in

(10)

• A two-level graph partitioning problem arising in mobile wireless communications
• Projection results for the \(k\)-partition problem
• Facets from gadgets
• Solving a multigroup mixed-integer programming-based constrained discrimination model
• On the location and \(p\)-median polytopes
• Transitive packing
• Chorded cycle facets of the clique partitioning polytope
• Corrigendum to: ``A polyhedral study of lifted multicuts
• New facets of the clique partitioning polytope
• A note on node packing polytopes on hypergraphs

This page was built for publication: Transitive Packing: A Unifying Concept in Combinatorial Optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4785885)