Enhancement of sandwich algorithms for approximating higher-dimensional convex Pareto sets
From MaRDI portal
Publication:2899142
Recommendations
- An approximation algorithm for convex multi-objective programming problems
- An algorithm for approximating nondominated points of convex multiobjective optimization problems
- Approximation of multi-dimensional Edgeworth-Pareto hull in non-linear multi-objective problems
- Set oriented methods for the numerical treatment of multiobjective optimization problems
- Two efficient algorithms for constructing almost even approximations of the Pareto front in multi-objective optimization problems
Cited in
(9)- Generalized inverse multiobjective optimization with application to cancer therapy
- An extension of the non-inferior set estimation algorithm for many objectives
- Multi-criteria optimization and decision-making in radiotherapy
- An approximation algorithm for multiobjective mixed-integer convex optimization
- Multi-objective optimization of long-run average and total rewards
- Bounds on efficient outcomes for large-scale cardinality-constrained Markowitz problems
- Approximating the Pareto set of multiobjective linear programs via robust optimization
- Real-Time Radiation Treatment Planning with Optimality Guarantees via Cluster and Bound Methods
- Integrating column generation in a method to compute a discrete representation of the non-dominated set of multi-objective linear programmes
This page was built for publication: Enhancement of sandwich algorithms for approximating higher-dimensional convex Pareto sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2899142)
