An iterative scheme for valid polynomial inequality generation in binary polynomial programming (Q3009764)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5912606
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An iterative scheme for valid polynomial inequality generation in binary polynomial programming |
scientific article; zbMATH DE number 5912606 |
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
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8943922519683838
0 references
0.7220712900161743
0 references
0.7161396741867065
0 references
0.7154537439346313
0 references
0.7145876884460449
0 references
