Outcome-space based B{\&}B algorithm for min-max affine fractional programs through a series of linear relaxation techniques to solve large-size problems (Q6926925)
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 8096521
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Outcome-space based B{\&}B algorithm for min-max affine fractional programs through a series of linear relaxation techniques to solve large-size problems |
scientific article; zbMATH DE number 8096521 |
Statements
Outcome-space based B{\&}B algorithm for min-max affine fractional programs through a series of linear relaxation techniques to solve large-size problems (English)
0 references
23 September 2025
0 references
min-max affine fractional program
0 references
outcome-space-based branch-and-bound
0 references
linear relaxation technique
0 references
linear relaxation problem
0 references
computational complexity
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
