An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming (Q3009764): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SparsePOP / rank | |||
Normal rank | |||
Revision as of 11:45, 29 February 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
