An approximation algorithm for multi-objective optimization problems using a box-coverage
From MaRDI portal
Recommendations
- A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions
- An approximation algorithm for convex multi-objective programming problems
- Covers and approximations in multiobjective optimization
- Approximation Methods for Multiobjective Optimization Problems: A Survey
- An algorithm for approximating the Pareto set of the multiobjective set covering problem
- A spectral approach to solve box-constrained multi-objective optimization problems
- scientific article; zbMATH DE number 1830716
- On approximate solutions in multiobjective optimization
- Efficient approximation algorithms for multi-objective constraint optimization
- An approximation method for the efficiency set of multiobjective programming problems
Cites work
- A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
- A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions
- A deterministic algorithm for global multi-objective optimization
- A general branch-and-bound framework for continuous global multiobjective optimization
- A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems
- A literature survey of benchmark functions for global optimisation problems
- A method for constrained multiobjective optimization based on SQP techniques
- A new scalarization technique and new algorithms to generate Pareto fronts
- A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets
- A one-step worst-case optimal algorithm for bi-objective univariate optimization
- Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems
- An algorithmic approach to multiobjective optimization with decision uncertainty
- An approximation algorithm for convex multi-objective programming problems
- An exact algorithm for biobjective integer programming problems
- An objective space cut and bound algorithm for convex multiplicative programmes
- Approximation methods in multiobjective programming
- Efficiency in multiple objective optimization problems
- Finding representative systems for discrete bicriterion optimization problems
- Improved -constraint method for multiobjective programming
- Multicriteria Optimization
- Non-convex multi-objective optimization
- Nonlinear multiobjective optimization
- Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
- On the representation of the search region in multi-objective optimization
- Primal and dual approximation algorithms for convex vector optimization problems
- Scalarizing vector optimization problems
- Set-valued optimization. An introduction with applications
- The multicriteria big cube small cube method
- The relationship between multi-objective robustness concepts and set-valued optimization
- Unbiased approximation in multicriteria optimization
- Variational methods in partially ordered spaces
- Widely Convergent Method for Finding Multiple Solutions of Simultaneous Nonlinear Equations
Cited in
(15)- Extending interval branch-and-bound from two to few objectives in nonlinear multiobjective optimization
- Adaptive sampling stochastic multigradient algorithm for stochastic multiobjective optimization
- Using dual relaxations in multiobjective mixed-integer convex quadratic programming
- Advancements in the computation of enclosures for multi-objective optimization problems
- Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs
- An algorithm for a multicriteria optimization problem and its application to a facility location problem
- Quadratic convex reformulations for multiobjective binary quadratic programming
- A hybrid patch decomposition approach to compute an enclosure for multi-objective mixed-integer convex optimization problems
- Deep learning the efficient frontier of convex vector optimization problems
- Computing the set of optimal points for nonconvex multi-objective optimization problems
- On necessary optimality conditions for sets of points in multiobjective optimization
- A solver for multiobjective mixed-integer convex and nonconvex optimization
- A path following method for box-constrained multiobjective optimization with applications to goal programming problems
- Approximating nondominated sets in continuous multiobjective optimization problems
- A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions
This page was built for publication: An approximation algorithm for multi-objective optimization problems using a box-coverage
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2141729)
