Strongly polynomial-time approximation for a class of bicriteria problems. (Q703276)
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: Strongly polynomial-time approximation for a class of bicriteria problems. |
scientific article; zbMATH DE number 2125916
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Strongly polynomial-time approximation for a class of bicriteria problems. |
scientific article; zbMATH DE number 2125916 |
Statements
Strongly polynomial-time approximation for a class of bicriteria problems. (English)
0 references
11 January 2005
0 references
Parametric method
0 references
Bicriteria optimization
0 references
0.8210656642913818
0 references
0.7963271141052246
0 references
0.7586130499839783
0 references
