Two efficient algorithms for constructing almost even approximations of the Pareto front in multi-objective optimization problems (Q5058972): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q129488089, #quickstatements; #temporary_batch_1728155793269
 
(2 intermediate revisions by 2 users not shown)
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
Property / cites work
 
Property / cites work: SMS-EMOA: multiobjective selection based on dominated hypervolume / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5701623 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Adaptive Scalarization Method in Multiobjective Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to approximate the bounded Pareto front / rank
 
Normal rank
Property / cites work
 
Property / cites work: A numerical method for constructing the Pareto front of multi-objective optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The normalized normal constraint method for generating the Pareto frontier / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Successive Approach to Compute the Bounded Pareto Front of Practical Multiobjective Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scalarizing vector optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal averaged Hausdorff archives for bi-objective problems: theoretical and numerical results / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding multiple Pareto-optimal solutions using classical and evolutionary generating methods / rank
 
Normal rank
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
    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

    Identifiers