An approach to fractional programming via d.c. constraints problem: local search (Q3133231)
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: An approach to fractional programming via d.c. constraints problem: local search |
scientific article; zbMATH DE number 6837861
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An approach to fractional programming via d.c. constraints problem: local search |
scientific article; zbMATH DE number 6837861 |
Statements
An Approach to Fractional Programming via D.C. Constraints Problem: Local Search (English)
0 references
13 February 2018
0 references
nonconvex optimization
0 references
rational optimization
0 references
d.c. representation
0 references
local search
0 references
linearized problems
0 references
0.851850152015686
0 references
0.8069496750831604
0 references
0.8033936023712158
0 references
0.7965289950370789
0 references
0.7941086888313293
0 references
