The Matching Polytope has Exponential Extension Complexity (Q4640350)

From MaRDI portal
Revision as of 09:41, 10 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6451554
  • The matching polytope has exponential extension complexity
Language Label Description Also known as
English
The Matching Polytope has Exponential Extension Complexity
scientific article; zbMATH DE number 6451554
  • The matching polytope has exponential extension complexity

Statements

The Matching Polytope has Exponential Extension Complexity (English)
0 references
The matching polytope has exponential extension complexity (English)
0 references
0 references
17 May 2018
0 references
26 June 2015
0 references
extension complexity
0 references
linear programming
0 references
matching
0 references
combinatorial optimization
0 references
linear programming relaxations
0 references
polytopes
0 references
0 references
0 references
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references