scientific article; zbMATH DE number 1530340
zbMATH Open1016.90041MaRDI QIDQ4514764FDOQ4514764
Publication date: 14 November 2000
Title of this publication is not available (Why is that?)
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
- What if we increase the number of objectives? Theoretical and empirical implications for many-objective combinatorial optimization
approximation algorithmsmulticriteria optimizationPareto optimal solutionscombinatorial problemsintractability\(\#\mathbb{P}\)-completeness\(\mathbb{N}\mathbb{P}\)-completenesscombinatorial multiobjective programmes
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)
Cited In (6)
- The power of the weighted sum scalarization for approximating multiobjective optimization problems
- Note on combinatorial optimization with max-linear objective functions
- Title not available (Why is that?)
- One-exact approximate Pareto sets
- Approximating multiobjective optimization problems: how exact can you be?
- Greedy algorithms for a class of knapsack problems with binary weights
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)
