\(NP\)-hardness of linear multiplicative programming and related problems (Q2564608)
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 966880
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(NP\)-hardness of linear multiplicative programming and related problems |
scientific article; zbMATH DE number 966880 |
Statements
\(NP\)-hardness of linear multiplicative programming and related problems (English)
0 references
15 January 1997
0 references
linear fractional programming
0 references
multi-ratio programming
0 references
linear multiplicative programming
0 references
linear inequality constraints
0 references
NP-hardness
0 references
0 references
0 references
0 references
0 references
0 references
0.8015522360801697
0 references
0.7954105734825134
0 references
0.7764641046524048
0 references
0.7755510807037354
0 references
0.7738982439041138
0 references
