Representation of the non-dominated set in biobjective discrete optimization
From MaRDI portal
Publication:342058
DOI10.1016/j.cor.2015.05.003zbMath1349.90752OpenAlexW1788341854MaRDI QIDQ342058
Kathrin Klamroth, Michael Stiglmayr, Carlos M. Fonseca, Luís Paquete, Daniel Vaz
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2015.05.003
Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Combinatorial optimization (90C27)
Related Items (13)
Biobjective robust optimization over the efficient set for Pareto set reduction ⋮ Bilevel programming for generating discrete representations in multiobjective optimization ⋮ Computing representations using hypervolume scalarizations ⋮ Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint ⋮ Finding representations for an unconstrained bi-objective combinatorial optimization problem ⋮ Representing the nondominated set in multi-objective mixed-integer programs ⋮ Discrete representation of non-dominated sets in multi-objective linear programming ⋮ Discrete representation of the non-dominated set for multi-objective optimization problems using kernels ⋮ A model of anytime algorithm performance for bi-objective optimization ⋮ Implicit enumeration strategies for the hypervolume subset selection problem ⋮ Equidistant representations: connecting coverage and uniformity in discrete biobjective optimization ⋮ A Method for Generating a Well-Distributed Pareto Set in Multiple Objective Mixed Integer Linear Programs Based on the Decision Maker’s Initial Aspiration Level ⋮ Decision space robustness for multi-objective integer linear programming
Cites Work
- Unnamed Item
- Unnamed Item
- On finding representative non-dominated points for bi-objective integer network flow problems
- On the quality of discrete representations in multiple objective programming
- A note on the \(\epsilon\)-indicator subset selection
- Locating stops along bus or railway lines -- a bicriteria problem
- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
- A study on two geometric location problems
- Improved complexity bounds for location problems on the real line
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
- Approximation methods in multiobjective programming
- On Beam Search for Multicriteria Combinatorial Optimization Problems
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- On Finding the Maxima of a Set of Vectors
- Towards finding global representations of the efficient set in multiple objective mathematical programming
- Bottleneck extrema
- Random knapsack in expected polynomial time
This page was built for publication: Representation of the non-dominated set in biobjective discrete optimization
