Verified methods for computing Pareto sets: general algorithmic analysis
From MaRDI portal
Recommendations
- Numerical certification of Pareto optimality for biobjective nonlinear problems
- Set oriented methods for the numerical treatment of multiobjective optimization problems
- Fast computation of equispaced Pareto manifolds and Pareto fronts for multiobjective optimization problems
- Set contraction algorithm for computing Pareto set in nonconvex nonsmooth multiobjective optimization
- From computing sets of optima, Pareto sets, and sets of Nash equilibria to general decision-related set computations
Cites work
- scientific article; zbMATH DE number 3871350 (Why is no real title available?)
- scientific article; zbMATH DE number 3900744 (Why is no real title available?)
- scientific article; zbMATH DE number 4070894 (Why is no real title available?)
- Approximation methods in multiobjective programming
- Computational complexity and feasibility of data processing and interval computations
- Introduction to precise numerical methods. With CD-ROM.
- Location theory. A unified approach
- Multiple criteria decision analysis. State of the art surveys
- Non-computable strategies and discounted repeated games
- Obtaining an outer approximation of the efficient set of nonlinear biobjective problems
- Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
- Reconciling franchisor and franchisee: a planar biobjective competitive location and design model
- Some relations between classical and constructive mathematics
This page was built for publication: Verified methods for computing Pareto sets: general algorithmic analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487155)
