Efficiently constructing convex approximation sets in multiobjective optimization problems

DOI10.1287/IJOC.2023.0220MaRDI QIDQ6896353zbMATH OpenFDO

Authors Stephan Helfrich, Stefan Ruzika, Clemens Thielen

Publication date 21 November 2025

Published in INFORMS Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

approximation algorithmmulti-objective optimizationBenson's methodconvex approximation sets

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cited in

(1)

• A survey of exact and approximation algorithms for linear-parametric optimization problems

This page was built for publication: Efficiently constructing convex approximation sets in multiobjective optimization problems

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