On the number of non-dominated points of a multicriteria optimization problem

DOI10.1016/j.dam.2013.07.010zbMath1288.90084OpenAlexW2081933089MaRDI QIDQ2446874

Florian Jamain, Cristina Bazgan, Daniel Vanderpooten

Publication date: 23 April 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.07.010

zbMATH Keywords

stability numbercomparability graphmulticriteria optimizationSperner propertyproduct of chainsnon-dominated points

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29)

Related Items (2)

What if we increase the number of objectives? Theoretical and empirical implications for many-objective combinatorial optimization ⋮ Branch-and-Bound for Biobjective Mixed-Integer Linear Programming

Cites Work

• On spanning tree problems with multiple objectives
• Computation of ideal and Nadir values and implications for their use in MCDM methods.
• Algorithmic graph theory and perfect graphs
• On the cardinality of the nondominated set of multi-objective combinatorial optimization problems
• Multicriteria Optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the number of non-dominated points of a multicriteria optimization problem