A branch-reduction-bound algorithm for linear fractional multi-product planning problems (Q6937757)
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 8085421
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-reduction-bound algorithm for linear fractional multi-product planning problems |
scientific article; zbMATH DE number 8085421 |
Statements
A branch-reduction-bound algorithm for linear fractional multi-product planning problems (English)
0 references
26 August 2025
0 references
linear fractional multiple products
0 references
global optimization
0 references
branch-and-bound
0 references
linear relaxation
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
