Accelerating convergence of cutting plane algorithms for disjoint bilinear programming (Q2460141)
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: Accelerating convergence of cutting plane algorithms for disjoint bilinear programming |
scientific article; zbMATH DE number 5211675
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Accelerating convergence of cutting plane algorithms for disjoint bilinear programming |
scientific article; zbMATH DE number 5211675 |
Statements
Accelerating convergence of cutting plane algorithms for disjoint bilinear programming (English)
0 references
14 November 2007
0 references
Linear programming
0 references
Bilinear programming
0 references
Cutting plane
0 references
Polar cuts
0 references
Lower bounding
0 references
0 references
0 references
0.8263144493103027
0 references
0.8184635639190674
0 references
0.814490020275116
0 references
0.7737640142440796
0 references
0.7698810696601868
0 references
