Approximate Pareto sets of minimal size for multi-objective optimization problems

DOI10.1016/j.orl.2014.10.003zbMath1408.90268OpenAlexW2128953879MaRDI QIDQ1785308

Cristina Bazgan, Daniel Vanderpooten, Florian Jamain

Publication date: 28 September 2018

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2014.10.003

zbMATH Keywords

multi-objective optimizationapproximation algorithmgreedy algorithmPareto setnon-dominated points

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)

Related Items (14)

An adaptive patch approximation algorithm for bicriteria convex mixed-integer problems ⋮ A general approximation method for bicriteria minimization problems ⋮ Approximation Methods for Multiobjective Optimization Problems: A Survey ⋮ Branch-and-Bound for Biobjective Mixed-Integer Linear Programming ⋮ Approximating biobjective minimization problems using general ordering cones ⋮ A coradiant based scalarization to characterize approximate solutions of vector optimization problems with variable ordering structures ⋮ Coradiant-valued maps and approximate solutions in variable ordering structures ⋮ Tour recommendation for groups ⋮ Finding representations for an unconstrained bi-objective combinatorial optimization problem ⋮ Covers and approximations in multiobjective optimization ⋮ Discrete representation of the non-dominated set for multi-objective optimization problems using kernels ⋮ Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines ⋮ One-exact approximate Pareto sets ⋮ The power of the weighted sum scalarization for approximating multiobjective optimization problems

Cites Work

• New approaches to multi-objective optimization
• Approximately dominating representatives
• Solving efficiently the 0-1 multi-objective knapsack problem
• A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem.
• Multicriteria optimization
• Efficiently computing succinct trade-off curves
• Approximating Multiobjective Knapsack Problems
• Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems
• Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
• Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
• Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications

This page was built for publication: Approximate Pareto sets of minimal size for multi-objective optimization problems