Two efficient algorithms for constructing almost even approximations of the Pareto front in multi-objective optimization problems (Q5058972): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/0305215x.2018.1479405 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2884049707 / rank | |||
Normal rank | |||
Revision as of 09:26, 30 July 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
