The cut cone. III: On the role of triangle facets

DOI10.1007/BF02988300zbMath0794.90046OpenAlexW2088209486MaRDI QIDQ5919846

Svatopluk Poljak, Monique Laurent, Michel Marie Deza

Publication date: 11 August 1993

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Combinatorial optimization (90C27)

Related Items

The volume of relaxed Boolean-quadric and cut polytopes, Graphic vertices of the metric polytope

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On qualitatively independent partitions and related problems
• A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound
• Matching theory
• The Boolean quadratic polytope: Some characteristics, facets and relatives
• Computing extreme rays of the metric cone for seven points
• Facets for the cut cone. II: Clique-web inequalities
• Collapsing and lifting for the cut cone
• On the Extreme Rays of the Metric Cone
• A Polynomial Algorithm for Constructing a Large Bipartite Subgraph, with an Application to a Satisfiability Problem
• Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions
• On the cut polytope
• Some Extremal Properties of Bipartite Subgraphs