scientific article; zbMATH DE number 1530340

zbMath1016.90041MaRDI QIDQ4514764

Matthias Ehrgott

Publication date: 14 November 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

combinatorial problemsPareto optimal solutionsapproximation algorithmsintractabilitymulticriteria optimization\(\#\mathbb{P}\)-completeness\(\mathbb{N}\mathbb{P}\)-completenesscombinatorial multiobjective programmes

Mathematics Subject Classification ID

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

Related Items (3)

Greedy algorithms for a class of knapsack problems with binary weights ⋮ One-exact approximate Pareto sets ⋮ The power of the weighted sum scalarization for approximating multiobjective optimization problems

This page was built for publication: