A disjunctive cutting plane algorithm for bilinear programming (Q6622752)
From MaRDI portal
!
WARNING
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 7930275
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A disjunctive cutting plane algorithm for bilinear programming |
scientific article; zbMATH DE number 7930275 |
Statements
A disjunctive cutting plane algorithm for bilinear programming (English)
0 references
22 October 2024
0 references
bilinear programming
0 references
nonconvex programming
0 references
disjunctive programming
0 references
global optimization
0 references
cutting planes
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8640501499176025
0 references
0.8174276947975159
0 references
0.8154714703559875
0 references
0.7961323261260986
0 references
