Complexity of discrete multicriteria problems
From MaRDI portal
Recommendations
Cites work
Cited in
(17)- Solvability of the vector problem by the linear criteria convolution algorithm
- On complete and quasi-complete two-criteria optimization problems on graphs
- Completeness of vector discrete optimization problems
- Conditions of solvability of vector problems using linear convolution of criteria
- Asymptotic optimality of a transport-problem plan constructed by the minimum-element method
- Problems of discrete optimization: challenges and main approaches to solve them
- scientific article; zbMATH DE number 4172753 (Why is no real title available?)
- scientific article; zbMATH DE number 4215847 (Why is no real title available?)
- Solving a bicriteria problem of optimal service centers location
- An algorithm for solving a class of discrete multicriterion problems
- scientific article; zbMATH DE number 4112386 (Why is no real title available?)
- Discrete minimization with levels of claims
- scientific article; zbMATH DE number 956504 (Why is no real title available?)
- scientific article; zbMATH DE number 26845 (Why is no real title available?)
- scientific article; zbMATH DE number 609997 (Why is no real title available?)
- Counting and enumeration complexity with application to multicriteria scheduling
- Criteria convolutions when combining the solutions of the multicriteria axial assignment problem
This page was built for publication: Complexity of discrete multicriteria problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4836160)