Combining semidefinite and polyhedral relaxations for integer programs (Q5101410): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/3-540-59408-6_46 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1527552358 / rank | |||
Normal rank | |||
Revision as of 00:56, 20 March 2024
scientific article; zbMATH DE number 7577886
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Combining semidefinite and polyhedral relaxations for integer programs |
scientific article; zbMATH DE number 7577886 |
Statements
Combining semidefinite and polyhedral relaxations for integer programs (English)
0 references
30 August 2022
0 references
constrained \(0-1\) quadratic programming
0 references
quadratic knapsack problem
0 references
