An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming (Q6099489): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:13, 10 July 2024
scientific article; zbMATH DE number 7698151
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
