Decision-making,
the multiple-aspect optimization,
a method of branches and borders,
tournament approaches to self-training,
representative casually generated entrance data,
heuristic algorithms.
Subject:
Heuristic algorithms — fast algorithms of decision-making in case of the multiple-aspect optimization, various updatings of a method of branches and borders, the multiheuristic approach, genetic algorithms and tournament approaches to self-training, imitating normalization and hybrid algorithms. The description of the approach to an estimation representative casually generated entrance data. The description of the approach to (heuristic) estimations of efficiency of heuristic algorithms. Generalizations of concepts of approximation and аппроксимационных algorithms.
Problems of discrete optimization — application in various subject anytime-algorithms.
Main publications:
Pivneva S.V. Melnikov B.F., “Multievristicheskii podkhod k zadacham diskretnoi optimizatsii”, Metody i sredstva obrabotki informatsii, Trudy tretei Vserossiiskoi nauchnoi konferentsii (6–8 oktyabrya 2009 g.), Mosk. gos. un-t im. M.V. Lomonosova, M.
B. Melnikov, E. A. Mel'nikova, S. Pivneva, E. V. Davydova, “Clustering of situations in solution algorithms of the traveling salesman problem and its application i some applied problems. Part I. General description of problems and algorithms”, University proceedings. Volga region. Physical and mathematical sciences, 2018, no. 3, 36–51
B. Melnikov, S. Pivneva, M. A. Trifonov, “Estimation of algorithms for calculation of distance between DNA lines”, University proceedings. Volga region. Physical and mathematical sciences, 2015, no. 2, 57–67
Contact us: