scientific article; zbMATH DE number 26845
From MaRDI portal
Publication:3983485
Recommendations
Cited in
(17)- Vectorization hierarchies of some graph quantifiers
- Note on combinatorial optimization with max-linear objective functions
- Completeness of vector discrete optimization problems
- Lexicographic optima in the multicriteria discrete optimization problem
- On local optima in multiobjective combinatorial optimization problems
- On the typical case complexity of graph optimization
- scientific article; zbMATH DE number 3906239 (Why is no real title available?)
- scientific article; zbMATH DE number 4070651 (Why is no real title available?)
- scientific article; zbMATH DE number 20617 (Why is no real title available?)
- scientific article; zbMATH DE number 1748022 (Why is no real title available?)
- scientific article; zbMATH DE number 1842063 (Why is no real title available?)
- Complexity of discrete multicriteria problems
- On combinatorial vector optimization problems
- On universal and multiobjective model extensions for combinatorial optimization problems
- The multiobjective shortest path problem is NP-hard, or is it?
- scientific article; zbMATH DE number 7711611 (Why is no real title available?)
- Theoretical and practical fundamentals for multi-objective optimisation in resource-constrained project scheduling problems
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 Q3983485)