A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems (Q2342947): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: MOIP_AIRA / rank | |||
Normal rank | |||
Revision as of 21:12, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems |
scientific article |
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
