Two efficient algorithms for constructing almost even approximations of the Pareto front in multi-objective optimization problems (Q5058972): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q129488089, #quickstatements; #temporary_batch_1728155793269 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q129488089 / rank | |||
Normal rank | |||
Latest revision as of 21:00, 5 October 2024
scientific article; zbMATH DE number 7636742
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two efficient algorithms for constructing almost even approximations of the Pareto front in multi-objective optimization problems |
scientific article; zbMATH DE number 7636742 |
Statements
Two efficient algorithms for constructing almost even approximations of the Pareto front in multi-objective optimization problems (English)
0 references
23 December 2022
0 references
multi-objective optimization problem
0 references
Pareto-optimal solution
0 references
Pascoletti-Serafini scalarization approach
0 references
\(\varepsilon\)-constraint method
0 references
0 references
0 references
0 references
0 references
0 references
