A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems (Q2342947)
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 6432466
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems |
scientific article; zbMATH DE number 6432466 |
Statements
A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems (English)
0 references
30 April 2015
0 references
discrete tricriteria optimization
0 references
scalarization
0 references
box algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7736097574234009
0 references
0.7626461386680603
0 references
0.7507922649383545
0 references
0.7468438744544983
0 references
0.7401624917984009
0 references
