On combinatorial vector optimization problems
From MaRDI portal
Recommendations
Cited in
(20)- On attainable distribution and classification vectors
- Solvability of the vector problem by the linear criteria convolution algorithm
- Stability, pseudostability, and quasistability of a multicriterial problem on a system of subsets
- Algorithmic solution of two parametric optimization problems of a set of complete combinations
- Combinatorial optimization problems with two and three criteria
- Solving combinatorial problems with combined min-max-min-sum objective and applications
- Completeness of vector discrete optimization problems
- Unsolvability of vector discrete optimization problems in the class of algorithms of linear convolution of criteria
- scientific article; zbMATH DE number 995809 (Why is no real title available?)
- On five types of stability of the lexicographic variant of the combinatorial bottleneck problem
- scientific article; zbMATH DE number 3873105 (Why is no real title available?)
- A polyhedral approach to the solution of a class of vector problems of combinatorial optimization
- scientific article; zbMATH DE number 26845 (Why is no real title available?)
- Solution of combinatorial optimization problems with minimax criterion
- scientific article; zbMATH DE number 1234735 (Why is no real title available?)
- Survey on vector complementarity problems
- Application of the direct generalisation of scalar algorithms in vector optimisation on graphs
- Combinatorial optimization in digital communications
- scientific article; zbMATH DE number 7092018 (Why is no real title available?)
- On simple combinatorial optimization problems. A collection of contributions in honour of Jack van Lint
This page was built for publication: On combinatorial vector optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4856879)
