The cut polytope and the Boolean quadric polytope (Q1825140): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The max-cut problem on graphs not contractible to \(K_ 5\) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the cut polytope / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5183511 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some Network Flow Problems Solved with Pseudo-Boolean Programming / rank | |||
Normal rank | |||
Revision as of 10:10, 20 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The cut polytope and the Boolean quadric polytope |
scientific article |
Statements
The cut polytope and the Boolean quadric polytope (English)
0 references
1990
0 references
cut polytopes
0 references
Boolean quadric polytope
0 references
bijective linear transformation
0 references
