An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming (Q3009764): 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/978-3-642-20807-2_17 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1576720100 / rank | |||
Normal rank | |||
Revision as of 02:41, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming |
scientific article |
Statements
An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming (English)
0 references
24 June 2011
0 references
binary polynomial programming
0 references
binary quadratic programming
0 references
valid inequality generation
0 references
semidefinite programming
0 references
