New SOCP relaxation and branching rule for bipartite bilinear programs (Q2331354)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: New SOCP relaxation and branching rule for bipartite bilinear programs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New SOCP relaxation and branching rule for bipartite bilinear programs |
scientific article |
Statements
New SOCP relaxation and branching rule for bipartite bilinear programs (English)
0 references
29 October 2019
0 references
convex hull
0 references
bilinear programming
0 references
branching rule
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
