Add to ORKGComplex discrete multicriteria problems over a combinatorial set of permutations are analyzed. Some properties of an admissible domain for a combinatorial multicriteria problem embedded into an arithmetic Euclidian space are considered. Optimality conditions are obtained for different types of effective solutions. A new approach to solving the problems formulated is constructed and substantiated
Dynamic systems with discrete time and with the vector index of the control quality are investigated...
Optimizing over the efficient set of a discrete multi-objective problem is a challenging issue. The ...
129 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2008.To address the post-optimalit...
Complex discrete multicriteria problems over a combinatorial set of permutations are analyzed. Some ...
The studies on multicriteria combinatorial optimization are continued. A possible approach to solvin...
The paper considers vector discrete optimization problem with linear fractional functions of criteri...
The studies on multicriteria combinatorial optimization are continued. A possible approach to solvin...
Vector optimization problems over a fuzzy combinatorial set of permutations are investigated. Based ...
The paper deals with a new method of solving a combinatorial problem with account for the properties...
The article is devoted to the problem of constructing and solving mathematical models of applied pro...
We consider an optimization problem on permutations with a linear-fractional objective function. We ...
In the paper we investigate the possibility of finding the Pareto set in combinatorial multicriteria...
We propose an approach to solve a multicriteria optimization problem on combinatorial configuration ...
Vector optimization problems over a fuzzy combinatorial set of permutations are investigated. Based ...
The statement of a problem of Euclidean combinatorial optimization with a fractional-linear objectiv...
Dynamic systems with discrete time and with the vector index of the control quality are investigated...
Optimizing over the efficient set of a discrete multi-objective problem is a challenging issue. The ...
129 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2008.To address the post-optimalit...
Complex discrete multicriteria problems over a combinatorial set of permutations are analyzed. Some ...
The studies on multicriteria combinatorial optimization are continued. A possible approach to solvin...
The paper considers vector discrete optimization problem with linear fractional functions of criteri...
The studies on multicriteria combinatorial optimization are continued. A possible approach to solvin...
Vector optimization problems over a fuzzy combinatorial set of permutations are investigated. Based ...
The paper deals with a new method of solving a combinatorial problem with account for the properties...
The article is devoted to the problem of constructing and solving mathematical models of applied pro...
We consider an optimization problem on permutations with a linear-fractional objective function. We ...
In the paper we investigate the possibility of finding the Pareto set in combinatorial multicriteria...
We propose an approach to solve a multicriteria optimization problem on combinatorial configuration ...
Vector optimization problems over a fuzzy combinatorial set of permutations are investigated. Based ...
The statement of a problem of Euclidean combinatorial optimization with a fractional-linear objectiv...
Dynamic systems with discrete time and with the vector index of the control quality are investigated...
Optimizing over the efficient set of a discrete multi-objective problem is a challenging issue. The ...
129 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2008.To address the post-optimalit...