Topics
combinatorial optimizationScientist
We consider a multiple objective combinatorial optimization problem with an arbitrary vector-criterion. The necessary and sufficient conditions for stability and quasistability are obtained for large classes of problems with partial criteria possessing certain properties of regularity
The studies on multicriteria combinatorial optimization are continued. A possible approach to solvin...
This work proposes an upper bound on the maximal number of non-dominated points of a multicriteria o...
International audienceThis work proposes an upper bound on the maximal number of non-dominated point...
We consider a vector generic combinatorial optimization problem in which initial coefficients of obj...
A multicriteria combinatorial problem with minimin partial criteria is considered. Necessary and suf...
We consider the multicriteria problem of combinatorial optimization with partial criteria of the kin...
In the paper we investigate the possibility of finding the Pareto set in combinatorial multicriteria...
The role played by the generalized convexity in optimization is nowadays well recognized. In this pa...
International audienceCombinatorial optimization problems serve as models for a great number of real...
A multicriteria linear programming problem with integer variables and parameterized optimality princ...
Several aspects of multiple criteria optimization are investigated. First, sufficient conditions ar...
multicriteria linear combinatorial problem is considered, principle of optimality of which is defi...
Multi-criteria optimization problems naturally arise in practice when there is no single criterion f...
In this paper we address the question of how many objective functions are needed to decide whether a...
In this paper we address the question of how many objective functions are needed to decide whether a...
The studies on multicriteria combinatorial optimization are continued. A possible approach to solvin...
This work proposes an upper bound on the maximal number of non-dominated points of a multicriteria o...
International audienceThis work proposes an upper bound on the maximal number of non-dominated point...
We consider a vector generic combinatorial optimization problem in which initial coefficients of obj...
A multicriteria combinatorial problem with minimin partial criteria is considered. Necessary and suf...
We consider the multicriteria problem of combinatorial optimization with partial criteria of the kin...
In the paper we investigate the possibility of finding the Pareto set in combinatorial multicriteria...
The role played by the generalized convexity in optimization is nowadays well recognized. In this pa...
International audienceCombinatorial optimization problems serve as models for a great number of real...
A multicriteria linear programming problem with integer variables and parameterized optimality princ...
Several aspects of multiple criteria optimization are investigated. First, sufficient conditions ar...
multicriteria linear combinatorial problem is considered, principle of optimality of which is defi...
Multi-criteria optimization problems naturally arise in practice when there is no single criterion f...
In this paper we address the question of how many objective functions are needed to decide whether a...
In this paper we address the question of how many objective functions are needed to decide whether a...
The studies on multicriteria combinatorial optimization are continued. A possible approach to solvin...
This work proposes an upper bound on the maximal number of non-dominated points of a multicriteria o...
International audienceThis work proposes an upper bound on the maximal number of non-dominated point...
Add to ORKG