Efficient dominance filtering for unions and Minkowski sums of non-dominated sets

DOI10.1016/J.COR.2023.106506MaRDI QIDQ6551105zbMATH OpenFDO

Authors Kathrin Klamroth, Bruno Lang, Michael Stiglmayr

Publication date 6 June 2024

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.COR.2023.106506

zbMATH Keywords

decompositiondominance filteringdynamic programmingmulti-objective optimizationND-trees

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A survey and annotated bibliography of multiobjective combinatorial optimization
• Boosting efficiency for computing the Pareto frontier on tree structured networks
• Computing efficiently the nondominated subset of a set sum
• scientific article; zbMATH DE number 3694968 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 1423920 (Why is no real title available?)
• Introducing multiobjective complex systems
• Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions
• Multicriteria Optimization
• On the multicriteria allocation problem

Cited in

(4)

• Generator sets for the Minkowski sum problem
• A novel cooperative co-evolutionary algorithm with context vector enhancement strategy for feature selection on high-dimensional classification
• (Multivariate) k-SUM as barrier to succinct computation
• Improved dominance filtering for unions and Minkowski sums of Pareto sets

This page was built for publication: Efficient dominance filtering for unions and Minkowski sums of non-dominated sets

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