Results 1 to 10 of about 56 (56)
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
EURO Journal on Computational Optimization, 2021 A conic optimization problem is a problem involving a constraint that the optimization variable be in some closed convex cone. Prominent examples are linear programs (LP), second order cone programs (SOCP), semidefinite problems (SDP), and copositive ...
Mirjam Dür, Franz Rendl
doaj +1 more source
Advances in Industrial and Manufacturing Engineering, 2021 The cutting process is an important stage of the industries which are dealing with cutting of small pieces from large items in such a way so that the wastage should be minimum.
Ravi Vishwakarma, P.L. Powar
doaj +1 more source
Mobility offer allocations in corporate settings
EURO Journal on Computational Optimization, 2021 Corporate mobility is often based on a fixed assignment of vehicles to employees. Relaxing this fixation and including alternatives such as public transportation or taxis for business and private trips could increase fleet utilization and foster the use ...
Sebastian Knopp +2 more
doaj +1 more source
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
EURO Journal on Computational Optimization, 2018 An instance of a balanced optimization problem with vector costs consists of a ground set X, a cost-vector for every element of X, and a system of feasible subsets over X.
AnnetteM.C. Ficker +2 more
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
Robust combinatorial optimization under budgeted–ellipsoidal uncertainty
EURO Journal on Computational Optimization, 2018 In the field of robust optimization, uncertain data are modeled by uncertainty sets which contain all relevant outcomes of the uncertain problem parameters. The complexity of the related robust problem depends strongly on the shape of the chosen set. Two
Jannis Kurtz
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