Computing efficiently the nondominated subset of a set sum
From MaRDI portal
Publication:6080591
DOI10.1111/itor.13191OpenAlexW4294724937MaRDI QIDQ6080591
Daniel Vanderpooten, Unnamed Author, 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
Cites Work
- Unnamed Item
- Maxima-finding algorithms for multidimensional samples: A two-phase approach
- Algebra of efficient sets for multiobjective complex systems
- Solving efficiently the 0-1 multi-objective knapsack problem
- Fast linear expected-time algorithms for computing maxima and convex hulls
- A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme
- Bicriteria Transportation Problem
- On Finding the Maxima of a Set of Vectors
- Multicriteria Optimization
This page was built for publication: Computing efficiently the nondominated subset of a set sum