Publication:4514764
From MaRDI portal
zbMath1016.90041MaRDI QIDQ4514764
Publication date: 14 November 2000
combinatorial problems; Pareto optimal solutions; approximation algorithms; intractability; multicriteria optimization; \(\#\mathbb{P}\)-completeness; \(\mathbb{N}\mathbb{P}\)-completeness; combinatorial multiobjective programmes
90C60: Abstract computational complexity for mathematical programming problems
90C29: Multi-objective and goal programming
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
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