Approximate Pareto sets of minimal size for multi-objective optimization problems
From MaRDI portal
Recommendations
- Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems
- Small approximate Pareto sets for biobjective shortest paths and other problems
- One-exact approximate Pareto sets
- Approximation with a fixed number of solutions of some biobjective maximization problems
- Approximation with a fixed number of solutions of some multiobjective maximization problems
Cites work
- A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem.
- Approximately dominating representatives
- Approximating multiobjective knapsack problems
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
- Efficiently computing succinct trade-off curves
- Multicriteria optimization
- Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications
- New approaches to multi-objective optimization
- Small approximate Pareto sets for biobjective shortest paths and other problems
- Solving efficiently the 0-1 multi-objective knapsack problem
Cited in
(29)- Approximation of a set of Pareto-optimal solutions
- Exact and approximate determination of the Pareto front using minimal correction subsets
- Structure and weak sharp minimum of the Pareto solution set for piecewise linear multiobjective optimization
- Coradiant-valued maps and approximate solutions in variable ordering structures
- scientific article; zbMATH DE number 7399394 (Why is no real title available?)
- A general approximation method for bicriteria minimization problems
- Convergence of stochastic search algorithms to finite size Pareto set approximations
- A coradiant based scalarization to characterize approximate solutions of vector optimization problems with variable ordering structures
- An adaptive patch approximation algorithm for bicriteria convex mixed-integer problems
- Approximation with a fixed number of solutions of some biobjective maximization problems
- One-exact approximate Pareto sets
- Small approximate Pareto sets for biobjective shortest paths and other problems
- Approximation Methods for Multiobjective Optimization Problems: A Survey
- Approximation with a fixed number of solutions of some multiobjective maximization problems
- Additive approximations of pareto-optimal sets by evolutionary multi-objective algorithms
- Approximating multiobjective optimization problems: how exact can you be?
- Using scalarizations for the approximation of multiobjective optimization problems: towards a general theory
- Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems
- The power of the weighted sum scalarization for approximating multiobjective optimization problems
- Branch-and-Bound for Biobjective Mixed-Integer Linear Programming
- Approximating biobjective minimization problems using general ordering cones
- Pareto set approximation by the method of adjustable weights and successive lexicographic goal programming
- Finding representations for an unconstrained bi-objective combinatorial optimization problem
- Dynamic algorithm selection for Pareto optimal set approximation
- Tour recommendation for groups
- Covers and approximations in multiobjective optimization
- Discrete representation of the non-dominated set for multi-objective optimization problems using kernels
- Computing the set of approximate solutions of a multi-objective optimization problem by means of cell mapping techniques
- Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines
This page was built for publication: Approximate Pareto sets of minimal size for multi-objective optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1785308)
