Generator sets for the Minkowski sum problem

DOI10.1016/J.EJOR.2025.07.005MaRDI QIDQ6862093zbMATH OpenFDO

Authors Mark Lyngesen, Sune Lauth Gadegaard, Lars Relund Nielsen

Publication date 9 February 2026

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJOR.2025.07.005

zbMATH Keywords

decompositionMinkowski summultiple criteria analysismultiple objective programming

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• Algebra of efficient sets for multiobjective complex systems
• Boosting efficiency for computing the Pareto frontier on tree structured networks
• Bound sets for biobjective combinatorial optimization problems
• Computing efficiently the nondominated subset of a set sum
• Efficient dominance filtering for unions and Minkowski sums of non-dominated sets
• Introducing multiobjective complex systems
• Multicriteria Optimization
• On the multicriteria allocation problem

This page was built for publication: Generator sets for the Minkowski sum problem

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