Generating facets for the cut polytope of a graph by triangular elimination (Q2465651): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q173840
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: David Avis / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2142464562 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: math/0601375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cut cone,L1 embeddability, complexity, and multicommodity flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the relationship between convex bodies related to correlation experiments with dichotomic observables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-party Bell inequalities derived from combinatorics via triangular elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the Bipartite Subgraph Polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cut polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3069694 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relevant two qubit Bell inequality inequivalent to the CHSH inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5183511 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets for the cut cone. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets for the cut cone. II: Clique-web inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Application of cut polyhedra. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of cut polyhedra. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry of cuts and metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: All facets of the cut cone \(C_ n\) for \(n=7\) are known / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Network Flow Problems Solved with Pseudo-Boolean Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum probability - quantum logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlation polytopes: Their geometry and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifting facets of the cut polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3523617 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shelling polyhedral 3-balls and 4-polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bell’s Theorem for General<i>N</i>-Qubit States / rank
 
Normal rank

Latest revision as of 13:45, 27 June 2024

scientific article
Language Label Description Also known as
English
Generating facets for the cut polytope of a graph by triangular elimination
scientific article

    Statements

    Generating facets for the cut polytope of a graph by triangular elimination (English)
    0 references
    0 references
    0 references
    0 references
    7 January 2008
    0 references
    Cut polytope
    0 references
    Lifting
    0 references
    Facet
    0 references
    Graph
    0 references
    Fourier-Motzkin elimination
    0 references

    Identifiers