An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming (Q6099489): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.cam.2023.115100 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.CAM.2023.115100 / rank | |||
Normal rank | |||
Latest revision as of 18:26, 30 December 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
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
