Discrete representation of the non-dominated set for multi-objective optimization problems using kernels

DOI10.1016/J.EJOR.2016.11.020MaRDI QIDQ1753501zbMATH OpenOpenAlexFDO

Authors Cristina Bazgan, Florian Jamain, Daniel Vanderpooten

Publication date 29 May 2018

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2016.11.020

zbMATH Keywords

kernelmultiple objective programmingPareto setnon-dominated pointsdiscrete representationexact and approximation algorithms

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Recommendations

• Representation of the non-dominated set in biobjective discrete optimization
• Equidistant representations: connecting coverage and uniformity in discrete biobjective optimization
• On the quality of discrete representations in multiple objective programming
• Discrete representation of non-dominated sets in multi-objective linear programming
• A Procedure to Find Discrete Representations of the Efficient Set with Specified Coverage Errors

Cites work

• scientific article; zbMATH DE number 3694968 (Why is no real title available?)
• scientific article; zbMATH DE number 46734 (Why is no real title available?)
• scientific article; zbMATH DE number 3465337 (Why is no real title available?)
• A simple efficient approximation scheme for the restricted shortest path problem
• An approximation algorithm for convex multi-objective programming problems
• An improved FPTAS for Restricted Shortest Path.
• Approximate Pareto sets of minimal size for multi-objective optimization problems
• Approximately dominating representatives
• Approximation methods in multiobjective programming
• Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits
• Budgeted matching and budgeted matroid intersection via the gasoline puzzle
• Covers and approximations in multiobjective optimization
• Discrete representation of non-dominated sets in multi-objective linear programming
• Efficiently computing succinct trade-off curves
• Graphes Noyau-Parfaits
• Implementing an efficient fptas for the 0-1 multi-objective knapsack problem
• Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
• Multicriteria optimization
• On finding representative non-dominated points for bi-objective integer network flow problems
• On the quality of discrete representations in multiple objective programming
• Representation of the non-dominated set in biobjective discrete optimization
• Small approximate Pareto sets for biobjective shortest paths and other problems
• Sur les quasi-noyaux d'un graphe. (On quasi-kernels of a graph)
• The constrained minimum spanning tree problem
• Two phase algorithms for the bi-objective assignment problem

Cited in

(7)

• Advancing local search approximations for multiobjective combinatorial optimization problems
• Approximation Methods for Multiobjective Optimization Problems: A Survey
• Approximating multiobjective optimization problems: how exact can you be?
• Branch-and-Bound for Biobjective Mixed-Integer Linear Programming
• Computing representations using hypervolume scalarizations
• Representation of the non-dominated set in biobjective discrete optimization
• Generating representative sets for multiobjective discrete optimization problems with specified coverage errors

This page was built for publication: Discrete representation of the non-dominated set for multi-objective optimization problems using kernels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1753501)