Approximability and Hardness in Multi-objective Optimization

DOI10.1007/978-3-642-13962-8_20MaRDI QIDQ3576204zbMATH OpenOpenAlexFDO

Authors Christian Glaßer, Christian Reitwießner, H. Schmitz, Maximilian Witek

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

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Multi-objective and goal programming (90C29) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• scientific article; zbMATH DE number 1830716
• Approximation in multiobjective optimization
• Approximation methods in multiobjective programming
• On approximate solutions in multiobjective optimization
• Approximate solutions of multiobjective optimization problems
• On approximate efficiency in multiobjective programming
• Approximation Methods for Multiobjective Optimization Problems: A Survey
• Approximation methods for multiobjective and parametric optimization problems
• On approximating weakly/properly efficient solutions in multi-objective programming
• Optimality conditions for approximate solutions in multiobjective optimization problems

Cited in

(17)

• The power of the weighted sum scalarization for approximating multiobjective optimization problems
• A general approximation method for bicriteria minimization problems
• scientific article; zbMATH DE number 5887313 (Why is no real title available?)
• Deterministic algorithms for multi-criteria TSP
• On the Hardness of Reoptimization with Multiple Given Solutions
• scientific article; zbMATH DE number 4172753 (Why is no real title available?)
• Approximating the nondominated frontiers of multi‐objective combinatorial optimization problems
• scientific article; zbMATH DE number 4070651 (Why is no real title available?)
• Multi-criteria TSP: Min and Max combined
• scientific article; zbMATH DE number 1530340 (Why is no real title available?)
• Approximation Methods for Multiobjective Optimization Problems: A Survey
• The multiobjective shortest path problem is NP-hard, or is it?
• Approximating biobjective minimization problems using general ordering cones
• Using scalarizations for the approximation of multiobjective optimization problems: towards a general theory
• MIP models and complexity results for DAG scheduling in the cloud
• Deterministic algorithms for multi-criteria max-TSP
• 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

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