An approximation algorithm for multi-objective optimization problems using a box-coverage (Q2141729): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10898-021-01109-9 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10898-021-01109-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3216881728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Widely Convergent Method for Finding Multiple Solutions of Simultaneous Nonlinear Equations / 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: A New Scalarization Technique and New Algorithms to Generate Pareto Fronts / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for biobjective integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved \(\varepsilon\)-constraint method for multiobjective programming / 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: An algorithmic approach to multiobjective optimization with decision uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic algorithm for global multi-objective 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: A Method for Constrained Multiobjective Optimization Based on SQP Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variational methods in partially ordered spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding representative systems for discrete bicriterion optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relationship between multi-objective robustness concepts and set-valued optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A literature survey of benchmark functions for global optimisation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set-valued Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the representation of the search region in multi-objective optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbiased approximation in multicriteria optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal and dual approximation algorithms for convex vector optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear multiobjective optimization / 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: Non-convex multi-objective optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scalarizing vector optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation methods in multiobjective programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multicriteria big cube small cube method / rank
 
Normal rank
Property / cites work
 
Property / cites work: An objective space cut and bound algorithm for convex multiplicative programmes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency in multiple objective optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A one-step worst-case optimal algorithm for bi-objective univariate 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
Property / DOI
 
Property / DOI: 10.1007/S10898-021-01109-9 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:30, 17 December 2024

scientific article
Language Label Description Also known as
English
An approximation algorithm for multi-objective optimization problems using a box-coverage
scientific article

    Statements

    An approximation algorithm for multi-objective optimization problems using a box-coverage (English)
    0 references
    0 references
    0 references
    25 May 2022
    0 references
    multi-objective optimization
    0 references
    approximation algorithm
    0 references
    nondominated set
    0 references
    enclosure
    0 references
    box-coverage
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references