On stability of a Pareto-optimal solution under perturbations of the parameters for a multicriteria combinatorial partition problem [PDF]
Computer Science Journal of Moldova, 2008 We consider a multicriteria variant for the well-known partition problem. A formula of the stability radius for an efficient solution was obtained. Mathematics Subject Classification 2000: 90C27, 90C29, 90C31.
V.A. Emelichev, E.E. Gurevsky
doaj +1 more source
Game-Theoretic Approach for Solving Multiobjective Flow Problems on Networks [PDF]
Computer Science Journal of Moldova, 2005 The game-theoretic formulation of the multiobjective multicommodity flow problem is considered. The dynamic version of this problem is studied and an algorithm for its solving, based on the concept of multiobjective games, is proposed.
Maria A. Fonoberova, Dmitrii D. Lozovanu
doaj +1 more source
On stability of Nash equilibrium situations and Pareto optimal situations in finite games [PDF]
Computer Science Journal of Moldova, 2003 A non-cooperative finite game of several persons is considered in the case, where payoff functions are linear. Extreme levels of independent perturbations of payoff functions parameters, which remain Nash and Pareto optimality of a situation, are ...
Vladimir A. Emelichev +1 more
doaj +1 more source
On stability in game problems of finding Nash set [PDF]
Computer Science Journal of Moldova, 2005 A finite game of several players in the case of linear payoff functions is considered. Stability of the problem of finding the set of Nash equilibrium situations is investigated.
Sergey E. Bukhtoyarov, Kirill G. Kuzmin
doaj +1 more source
Postoptimal analysis of one lexicographic combinatorial problem with non-linear criteria [PDF]
Computer Science Journal of Moldova, 2009 In this article we consider a multicriteria combinatorial problem with ordered MINMIN criteria. We obtain necessary and sufficient conditions of that type of stability to the initial data perturbations for which all lexicographic optima of the original ...
Vladimir A. Emelichev, Olga V. Karelkina
doaj +1 more source
The maximum flow in dynamic networks [PDF]
Computer Science Journal of Moldova, 2005 The dynamic maximum flow problem that generalizes the static maximum flow problem is formulated and studied. We consider the problem on a network with capacities depending on time, fixed transit times on the arcs, and a given time horizon.
Maria A. Fonoberova, Dmitrii D. Lozovanu
doaj +1 more source
Polynomial Time Algorithm for Determining Max-Min Paths in Networks and Solving Zero Value Cyclic Games [PDF]
Computer Science Journal of Moldova, 2005 We study the max-min paths problem, which represents a game version of the shortest and the longest paths problem in a weighted directed graph. In this problem the vertex set V of the weighted directed graph G=(V,E) is divided into two disjoint subsets ...
Dmitrii D. Lozovanu
doaj +1 more source
The minimum cost multicommodity flow problem in dynamic networks and an algorithm for its solving [PDF]
Computer Science Journal of Moldova, 2005 The dynamic version of the minimum cost multicommodity flow problem that generalizes the static minimum cost multicommodity flow problem is formulated and studied.
Maria A. Fonoberova, Dmitrii D. Lozovanu
doaj +1 more source
Evolution of group-theoretic cryptology attacks using hyper-heuristics
Journal of Mathematical Cryptology, 2021 In previous work, we developed a single evolutionary algorithm (EA) to solve random instances of the Anshel–Anshel–Goldfeld (AAG) key exchange protocol over polycyclic groups. The EA consisted of six simple heuristics which manipulated strings.
Craven Matthew J., Woodward John R.
doaj +1 more source
A new conjugate gradient method for acceleration of gradient descent algorithms
Moroccan Journal of Pure and Applied Analysis, 2021 An accelerated of the steepest descent method for solving unconstrained optimization problems is presented. which propose a fundamentally different conjugate gradient method, in which the well-known parameter βk is computed by an new formula.
Rahali Noureddine +2 more
doaj +1 more source