Discrete representation of the non-dominated set for multi-objective optimization problems using kernels
From MaRDI portal
Publication:1753501
DOI10.1016/j.ejor.2016.11.020zbMath1403.90591OpenAlexW2551495248MaRDI QIDQ1753501
Florian Jamain, Daniel Vanderpooten, Cristina Bazgan
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
kernelmultiple objective programmingPareto setnon-dominated pointsdiscrete representationexact and approximation algorithms
Related Items (4)
Advancing local search approximations for multiobjective combinatorial optimization problems ⋮ Approximation Methods for Multiobjective Optimization Problems: A Survey ⋮ Branch-and-Bound for Biobjective Mixed-Integer Linear Programming ⋮ Computing representations using hypervolume scalarizations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits
- On finding representative non-dominated points for bi-objective integer network flow problems
- Representation of the non-dominated set in biobjective discrete optimization
- On the quality of discrete representations in multiple objective programming
- Covers and approximations in multiobjective optimization
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle
- An approximation algorithm for convex multi-objective programming problems
- Approximately dominating representatives
- Implementing an efficient fptas for the 0-1 multi-objective knapsack problem
- Sur les quasi-noyaux d'un graphe. (On quasi-kernels of a graph)
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
- Multicriteria optimization
- Discrete representation of non-dominated sets in multi-objective linear programming
- Approximate Pareto sets of minimal size for multi-objective optimization problems
- An improved FPTAS for Restricted Shortest Path.
- Two phase algorithms for the bi-objective assignment problem
- Efficiently computing succinct trade-off curves
- Approximation methods in multiobjective programming
- Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems
- Graphes Noyau-Parfaits
- The constrained minimum spanning tree problem
- A simple efficient approximation scheme for the restricted shortest path problem
This page was built for publication: Discrete representation of the non-dominated set for multi-objective optimization problems using kernels
