The cutting plane method is polynomial for perfect matchings (Q2800362)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The cutting plane method is polynomial for perfect matchings |
scientific article; zbMATH DE number 6569354
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The cutting plane method is polynomial for perfect matchings |
scientific article; zbMATH DE number 6569354 |
Statements
15 April 2016
0 references
integer programs
0 references
cutting planes
0 references
linear programs
0 references
matchings
0 references
blossom inequalities
0 references
graph theory
0 references
half-integrality
0 references
0.9020795
0 references
0.89157724
0 references
0.8763899
0 references
0.8763899
0 references
0.8591363
0 references
0.85584825
0 references
0.85055876
0 references
The cutting plane method is polynomial for perfect matchings (English)
0 references
