An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems (Q2116605)
From MaRDI portal
!
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 7492863
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems |
scientific article; zbMATH DE number 7492863 |
Statements
An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems (English)
0 references
18 March 2022
0 references
global optimization
0 references
quadratic fractional programming
0 references
branch-and-bound
0 references
outcome space
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8127791285514832
0 references
0.7908064723014832
0 references
0.7893611788749695
0 references
0.785128653049469
0 references
