Discrete representation of the non-dominated set for multi-objective optimization problems using kernels
type: Item
instance of: scholarly article
title: Discrete representation of the non-dominated set for multi-objective optimization problems using kernels
zbMATH Open document ID: 1403.90591
author: Cristina Bazgan
author: Florian Jamain
author: Daniel Vanderpooten
published in: European Journal of Operational Research
publication date: 2018-05-29T00:00:00Z
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 6875814
zbMATH Keywords: multiple objective programming
zbMATH Keywords: Pareto set
zbMATH Keywords: non-dominated points
zbMATH Keywords: discrete representation
zbMATH Keywords: exact and approximation algorithms
zbMATH Keywords: kernel
MaRDI profile type: Publication
full work available at URL: j.ejor.2016.11.020
OpenAlex ID: W2551495248
cites work: Implementing an efficient fptas for the 0-1 multi-objective knapsack problem
cites work: Approximate Pareto sets of minimal size for multi-objective optimization problems
cites work: Budgeted matching and budgeted matroid intersection via the gasoline puzzle
cites work: Q4050630
cites work: Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems
cites work: Graphes Noyau-Parfaits
cites work: Sur les quasi-noyaux d'un graphe. (On quasi-kernels of a graph)
cites work: Multicriteria optimization
cites work: An approximation algorithm for convex multi-objective programming problems
cites work: An improved FPTAS for Restricted Shortest Path.
cites work: On finding representative non-dominated points for bi-objective integer network flow problems
cites work: On the quality of discrete representations in multiple objective programming
cites work: Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits
cites work: Q3888874
cites work: Approximately dominating representatives
cites work: A simple efficient approximation scheme for the restricted shortest path problem
cites work: Two phase algorithms for the bi-objective assignment problem
cites work: The constrained minimum spanning tree problem
cites work: Approximation methods in multiobjective programming
cites work: Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
cites work: Discrete representation of non-dominated sets in multi-objective linear programming
cites work: Covers and approximations in multiobjective optimization
cites work: Efficiently computing succinct trade-off curves
cites work: Representation of the non-dominated set in biobjective discrete optimization
cites work: Q3996913
DOI: 10.1016/J.EJOR.2016.11.020
description: scientific article; zbMATH DE number 6875814