Facets for the cut cone. II: Clique-web inequalities

DOI10.1007/BF01580898MaRDI QIDQ1199750zbMATH OpenFDO

Authors Monique Laurent, Michel Deza

Publication date 16 January 1993

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01580898

zbMATH Keywords

antiwebclique-web inequalitiescycle inequalitiesfacets for the cut conehypermetric inequalitysemi-metrics

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• Facets for the cut cone. I
• The inequicut cone
• Clique-Web Facets for Multicut Polytopes
• On the cut polytope
• Collapsing and lifting for the cut cone

Cites work

• An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
• Clique-Web Facets for Multicut Polytopes
• Collapsing and lifting for the cut cone
• Espaces Métriques Plongeables Dans Un Hypercube: Aspects Combinatoires
• Facets for the cut cone. I
• Facets of the Bipartite Subgraph Polytope
• scientific article; zbMATH DE number 6004030 (Why is no real title available?)
• scientific article; zbMATH DE number 3750962 (Why is no real title available?)
• scientific article; zbMATH DE number 17640 (Why is no real title available?)
• scientific article; zbMATH DE number 3509353 (Why is no real title available?)
• scientific article; zbMATH DE number 3432276 (Why is no real title available?)
• On the cut polytope
• The cut cone,L1 embeddability, complexity, and multicommodity flows
• The CW-inequalities for vectors in \(\ell_ 1\)
• The equipartition polytope. I: Formulations, dimension and basic facets
• The hypermetric cone is polyhedral
• The inequicut cone

Cited in

(26)

• Compositions in the bipartite subgraph polytope
• Facets for the cut cone. I
• An extended formulation approach to the edge-weighted maximal clique problem
• The hypermetric cone is polyhedral
• Collapsing and lifting for the cut cone
• The CW-inequalities for vectors in \(\ell_ 1\)
• Application of cut polyhedra. I
• Facets of the \(k\)-partition polytope
• Some new classes of facets for the equicut polytope
• Generating facets for the cut polytope of a graph by triangular elimination
• Facet-defining inequalities for the simple graph partitioning polytope
• A polyhedral study of lifted multicuts
• Stochastic graph partitioning: quadratic versus SOCP formulations
• Clique-Web Facets for Multicut Polytopes
• On the cone of weighted graphs generated by triangles
• A Note on Clique-Web Facets for Multicut Polytopes
• The cut cone. III: On the role of triangle facets
• The cut cone. III: On the role of triangle facets
• A Lagrangian relaxation approach to the edge-weighted clique problem
• On the bond polytope
• On the dominant of the multicut polytope
• The real positive semidefinite completion problem for series-parallel graphs
• The inequicut cone
• The even and odd cut polytopes
• Pseudo-Boolean optimization
• ``Miniaturized linearizations for quadratic 0/1 problems

This page was built for publication: Facets for the cut cone. II: Clique-web inequalities

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