Solving hypervolume scalarizations for MOCO problems

DOI10.1016/J.COR.2026.107578MaRDI QIDQ7348448zbMATH OpenFDO

Authors Gonçalo Lopes, Kathrin Klamroth, Luís Paquete

Publication date 15 September 2026

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

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

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A greedy hypervolume polychotomic scheme for multiobjective combinatorial optimization
• Accurately computing the log-sum-exp and softmax functions
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Computing representations using hypervolume scalarizations
• Discrete-variable extremum problems
• Hypervolume scalarization for shape optimization to improve reliability and cost of ceramic components
• Multicriteria Optimization
• On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem

This page was built for publication: Solving hypervolume scalarizations for MOCO problems

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