Approximating the Pareto front of multi-criteria optimization problems
From MaRDI portal
Recommendations
- Efficient approximation algorithms for multi-objective constraint optimization
- Constructing a Pareto front approximation for decision making
- Two-sided Pareto front approximations
- Approximate solution of multicriterion problems with functional limitations
- Comparison of two Pareto frontier approximations
Cited in
(38)- Pareto analysis vis-à-vis balance space approach in multiobjective global optimization
- On upper approximations of Pareto fronts
- Greening of maritime transportation: a multi-objective optimization approach
- Pareto optimization or cascaded weighted sum: a comparison of concepts
- Correction to: ``Pareto optimization or cascaded weighted sum: a comparison of concepts
- Tour recommendation for groups
- A new Pareto set generating method for multi-criteria optimization problems
- \textsc{OptiMathSAT}: a tool for optimization modulo theories
- Stability verification and timing contract synthesis for linear impulsive systems using reachability analysis
- Simple and efficient bi-objective search algorithms via fast dominance checks
- The Directed Search Method for Pareto Front Approximations with Maximum Dominated Hypervolume
- A simple method for approximating a general Pareto surface
- Efficient approximation algorithms for multi-objective constraint optimization
- Pareto efficiency and approximate Pareto efficiency in routing and load balancing games
- A Successive Approach to Compute the Bounded Pareto Front of Practical Multiobjective Optimization Problems
- Approximation of a set of Pareto-optimal solutions
- scientific article; zbMATH DE number 614558 (Why is no real title available?)
- Two-sided Pareto front approximations
- Pareto frontier visualization in multi-criteria search for efficient therapy strategies: HIV infection example
- scientific article; zbMATH DE number 7379290 (Why is no real title available?)
- An adaptive patch approximation algorithm for bicriteria convex mixed-integer problems
- Covers and approximations in multiobjective optimization
- True Pareto fronts for multi-objective AI planning instances
- Constructing a Pareto front approximation for decision making
- Stochastic convergence of random search methods to fixed size Pareto front approximations
- Hypervolume Subset Selection for Triangular and Inverted Triangular Pareto Fronts of Three-Objective Problems
- Aggregate objective functions and Pareto frontiers: required relationships and practical implications
- Pareto front approximation through a multi-objective augmented Lagrangian method
- Server cloud scheduling
- scientific article; zbMATH DE number 7695068 (Why is no real title available?)
- Exact and approximate determination of the Pareto front using minimal correction subsets
- Characterization, verification and computation of robust controlled invariants for monotone dynamical systems
- New core-guided and hitting set algorithms for multi-objective combinatorial optimization
- Unsatisfiability-based algorithms for multi-objective combinatorial optimization
- Pareto set approximation by the method of adjustable weights and successive lexicographic goal programming
- Efficient approximation quality computation for sandwiching algorithms for convex multicriteria optimization
- A new approach to approximate the bounded Pareto front
- A note on global Pareto optimality in multicriteria optimization problems
This page was built for publication: Approximating the Pareto front of multi-criteria optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3557068)
