A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes (Q833581)
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: A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes |
scientific article; zbMATH DE number 5595314
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes |
scientific article; zbMATH DE number 5595314 |
Statements
A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes (English)
0 references
14 August 2009
0 references
mixed-integer non linear programs
0 references
reformulations
0 references
second-order cone programs
0 references
valid inequalities
0 references
unit commitment problem
0 references
portfolio optimization
0 references
0 references
0 references
0 references
0.8490374684333801
0 references
0.8221486210823059
0 references
0.805813193321228
0 references
0.7814096808433533
0 references
0.7557075619697571
0 references
