Approximability and Hardness in Multi-objective Optimization
From MaRDI portal
Publication:3576204
DOI10.1007/978-3-642-13962-8_20zbMath1286.90136OpenAlexW1493541567MaRDI QIDQ3576204
Maximilian Witek, Christian Reitwießner, Christian Glaßer, Heinz Schmitz
Publication date: 29 July 2010
Published in: Programs, Proofs, Processes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-13962-8_20
Abstract computational complexity for mathematical programming problems (90C60) Multi-objective and goal programming (90C29) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (8)
A general approximation method for bicriteria minimization problems ⋮ Approximation Methods for Multiobjective Optimization Problems: A Survey ⋮ Approximating biobjective minimization problems using general ordering cones ⋮ Multi-criteria TSP: Min and Max combined ⋮ Deterministic Algorithms for Multi-criteria TSP ⋮ Deterministic algorithms for multi-criteria max-TSP ⋮ The power of the weighted sum scalarization for approximating multiobjective optimization problems ⋮ An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem
This page was built for publication: Approximability and Hardness in Multi-objective Optimization
