A new branch-and-cut algorithm for linear sum-of-ratios problem based on SLO method and LO relaxation (Q6667698)
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: A new branch-and-cut algorithm for linear sum-of-ratios problem based on SLO method and LO relaxation |
scientific article; zbMATH DE number 7971700
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new branch-and-cut algorithm for linear sum-of-ratios problem based on SLO method and LO relaxation |
scientific article; zbMATH DE number 7971700 |
Statements
A new branch-and-cut algorithm for linear sum-of-ratios problem based on SLO method and LO relaxation (English)
0 references
20 January 2025
0 references
global optimization
0 references
fractional programming
0 references
sum-of-ratios
0 references
successive linear optimization
0 references
linear optimization relaxation
0 references
branch-and-cut
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
0 references
