An efficient branch-and-bound algorithm using an adaptive branching rule with quadratic convex relaxation for globally solving general linear multiplicative programs (Q6581973)
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: An efficient branch-and-bound algorithm using an adaptive branching rule with quadratic convex relaxation for globally solving general linear multiplicative programs |
scientific article; zbMATH DE number 7890859
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient branch-and-bound algorithm using an adaptive branching rule with quadratic convex relaxation for globally solving general linear multiplicative programs |
scientific article; zbMATH DE number 7890859 |
Statements
An efficient branch-and-bound algorithm using an adaptive branching rule with quadratic convex relaxation for globally solving general linear multiplicative programs (English)
0 references
1 August 2024
0 references
branch-and-bound
0 references
convex relaxation
0 references
linear multiplicative programming
0 references
global optimization
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8954019546508789
0 references
0.8861161470413208
0 references
0.8832886219024658
0 references
0.8827533721923828
0 references
0.8827133178710938
0 references
