scientific article; zbMATH DE number 1530340

MaRDI QIDQ4514764zbMATHFDO

Authors Matthias Ehrgott

Publication date 14 November 2000

zbMATH Keywords

approximation algorithmsmulticriteria optimizationPareto optimal solutionscombinatorial problemsintractability\(\#\mathbb{P}\)-completeness\(\mathbb{N}\mathbb{P}\)-completenesscombinatorial multiobjective programmes

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Multi-objective combinatorial optimization: problematic and context
• Approximability and Hardness in Multi-objective Optimization
• scientific article; zbMATH DE number 4070651
• Multiobjective (Combinatorial) optimisation-some thoughts on applications
• Multiobjective combinatorial optimization: some approaches
• scientific article; zbMATH DE number 2159075
• scientific article; zbMATH DE number 2160609
• Multi‐objective combinatorial optimization problems: A survey
• scientific article; zbMATH DE number 3873107
• What if we increase the number of objectives? Theoretical and empirical implications for many-objective combinatorial optimization

Cited in

(9)

• One-exact approximate Pareto sets
• Note on combinatorial optimization with max-linear objective functions
• Approximating multiobjective optimization problems: how exact can you be?
• The power of the weighted sum scalarization for approximating multiobjective optimization problems
• Computational complexity of finding Pareto efficient outcomes for biobjective lot-sizing models
• On the cardinality of the nondominated set of multi-objective combinatorial optimization problems
• Greedy algorithms for a class of knapsack problems with binary weights
• scientific article; zbMATH DE number 4070651 (Why is no real title available?)
• The multiobjective shortest path problem is NP-hard, or is it?

This page was built for publication:

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