Reference-point-based branch and bound algorithm for multiobjective optimization (Q6203550): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4868589 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\alpha BB\): A global optimization method for general constrained nonconvex problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2723294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for convex multi-objective programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general branch-and-bound framework for continuous global multiobjective optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lipschitzian optimization without the Lipschitz constant / rank
 
Normal rank
Property / cites work
 
Property / cites work: g-dominance: Reference point based dominance for multiobjective metaheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval Methods for Systems of Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A preference-based evolutionary algorithm for multiobjective optimization: the weighting achievement scalarizing function genetic algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria optimization using a genetic algorithm for determining a Pareto set / rank
 
Normal rank
Property / cites work
 
Property / cites work: On one-step worst-case optimal trisection in univariate bi-objective Lipschitz optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems / rank
 
Normal rank

Revision as of 19:52, 29 August 2024

scientific article; zbMATH DE number 7827855
Language Label Description Also known as
English
Reference-point-based branch and bound algorithm for multiobjective optimization
scientific article; zbMATH DE number 7827855

    Statements

    Reference-point-based branch and bound algorithm for multiobjective optimization (English)
    0 references
    0 references
    0 references
    5 April 2024
    0 references
    multiobjective optimization
    0 references
    branch-and-bound algorithm
    0 references
    preference information
    0 references
    reference point
    0 references

    Identifiers