A fully polynomial time approximation algorithm for generalized fractional programs (Q3462697)
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 6531162
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fully polynomial time approximation algorithm for generalized fractional programs |
scientific article; zbMATH DE number 6531162 |
Statements
15 January 2016
0 references
fractional programming
0 references
global optimization
0 references
approximation algorithm
0 references
computational complexity
0 references
0.923232913017273
0 references
0.9169269800186156
0 references
0.9135749340057372
0 references
0.8891569972038269
0 references
