Back to Search
Start Over
On the hardest problem formulations for the 0/1 Lasserre hierarchy
- Source :
- Mathematics of Operations Research. February, 2017, Vol. 42 Issue 1, p135, 9 p.
- Publication Year :
- 2017
-
Abstract
- Abstract. The Lasserre/Sum-of-Squares (SoS) hierarchy is a systematic procedure for constructing a sequence of increasingly tight semidefinite relaxations. It is known that the hierarchy converges to the 0/1 poly tope [...]
Details
- Language :
- English
- ISSN :
- 0364765X
- Volume :
- 42
- Issue :
- 1
- Database :
- Gale General OneFile
- Journal :
- Mathematics of Operations Research
- Publication Type :
- Academic Journal
- Accession number :
- edsgcl.485578704
- Full Text :
- https://doi.org/10.1287/moor.2016.0797