Discrete representation of the non-dominated set for multi-objective optimization problems using kernels
DOI10.1016/J.EJOR.2016.11.020zbMATH Open1403.90591OpenAlexW2551495248MaRDI QIDQ1753501FDOQ1753501
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
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
kernelmultiple objective programmingPareto setnon-dominated pointsdiscrete representationexact and approximation algorithms
Cites Work
- Multicriteria optimization
- An improved FPTAS for Restricted Shortest Path.
- The constrained minimum spanning tree problem
- A simple efficient approximation scheme for the restricted shortest path problem
- Two phase algorithms for the bi-objective assignment problem
- Graphes Noyau-Parfaits
- Title not available (Why is that?)
- 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
- Approximation methods in multiobjective programming
- Title not available (Why is that?)
- Efficiently computing succinct trade-off curves
- Small approximate Pareto sets for biobjective shortest paths and other problems
- On finding representative non-dominated points for bi-objective integer network flow problems
- Representation of the non-dominated set in biobjective discrete optimization
- Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits
- On the quality of discrete representations in multiple objective programming
- Approximately dominating representatives
- Discrete representation of non-dominated sets in multi-objective linear programming
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle
- Title not available (Why is that?)
- An approximation algorithm for convex multi-objective programming problems
- Approximate Pareto sets of minimal size for multi-objective optimization problems
- Covers and approximations in multiobjective optimization
- Sur les quasi-noyaux d'un graphe. (On quasi-kernels of a graph)
Cited In (7)
- Approximation Methods for Multiobjective Optimization Problems: A Survey
- Branch-and-Bound for Biobjective Mixed-Integer Linear Programming
- Approximating multiobjective optimization problems: how exact can you be?
- Representation of the non-dominated set in biobjective discrete optimization
- Advancing local search approximations for multiobjective combinatorial optimization problems
- Computing representations using hypervolume scalarizations
- 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)
