Computing efficiently the nondominated subset of a set sum

DOI10.1111/ITOR.13191MaRDI QIDQ6080591zbMATH OpenOpenAlexFDO

Authors Daniel Vanderpooten, Jean-Michel Vanpeperstraete

Publication date 4 October 2023

Published in International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/itor.13191

zbMATH Keywords

decompositionMinkowski summultiobjective optimizationnondominated set

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites work

• A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme
• A study of global convexity for a multiple objective travelleling salesman problem
• Algebra of efficient sets for multiobjective complex systems
• Bicriteria Transportation Problem
• Fast linear expected-time algorithms for computing maxima and convex hulls
• Maxima-finding algorithms for multidimensional samples: A two-phase approach
• Multicriteria Optimization
• On Finding the Maxima of a Set of Vectors
• Solving efficiently the 0-1 multi-objective knapsack problem

Cited in

(5)

• Fast Monotone Summation over Disjoint Sets
• Complexity and algorithms for finding a subset of vectors with the longest sum
• Efficient dominance filtering for unions and Minkowski sums of non-dominated sets
• Generator sets for the Minkowski sum problem
• Improved dominance filtering for unions and Minkowski sums of Pareto sets

This page was built for publication: Computing efficiently the nondominated subset of a set sum

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