An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming (Q6099489)
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 7698151
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming |
scientific article; zbMATH DE number 7698151 |
Statements
An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming (English)
0 references
20 June 2023
0 references
linear multiplicative programming
0 references
second order cone relaxation
0 references
adaptive branching
0 references
branch-and-bound
0 references
piecewise linear approximation
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 references
0 references
0 references
0.8669220209121704
0 references
0.8636281490325928
0 references
0.8633452653884888
0 references
0.8565709590911865
0 references
0.8487647175788879
0 references
