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

DOI10.1016/J.DAM.2013.07.010MaRDI QIDQ2446874zbMATH OpenOpenAlexFDO

Authors Cristina Bazgan, Florian Jamain, 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

comparability graphmulticriteria optimizationnon-dominated pointsproduct of chainsSperner propertystability number

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 597767
• On the cardinality of the nondominated set of multi-objective combinatorial optimization problems
• An algorithm for approximating nondominated points of convex multiobjective optimization problems
• Finding all nondominated points of multi-objective integer programs
• scientific article; zbMATH DE number 3978850
• Finding non dominated points for multiobjective integer convex programs with linear constraints
• scientific article; zbMATH DE number 3936958
• Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems
• Approximating nondominated sets in continuous multiobjective optimization problems
• The domination property in multicriteria optimization

Cites work

• Algorithmic graph theory and perfect graphs
• Computation of ideal and Nadir values and implications for their use in MCDM methods.
• scientific article; zbMATH DE number 6006014 (Why is no real title available?)
• scientific article; zbMATH DE number 496228 (Why is no real title available?)
• scientific article; zbMATH DE number 1774199 (Why is no real title available?)
• scientific article; zbMATH DE number 3065933 (Why is no real title available?)
• Multicriteria Optimization
• On spanning tree problems with multiple objectives
• On the cardinality of the nondominated set of multi-objective combinatorial optimization problems

Cited in

(6)

• Average number of options nondominated with respect to a binary relation
• The domination property in multicriteria optimization
• On the cardinality of the nondominated set of multi-objective combinatorial optimization problems
• What if we increase the number of objectives? Theoretical and empirical implications for many-objective combinatorial optimization
• A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems
• Branch-and-Bound for Biobjective Mixed-Integer Linear Programming

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2446874)