05.13.01 (System analysis, the control and processing of information (separated by fields))
Birth date:
19.06.1973
Keywords:
Genetic Algorithm,
random search,
greedy algorithm,
$p$-median,
$k$-means,
Weber problem.
UDC:
519.6
Subject:
Heuristic algorithms for clustering and location problems
Main publications:
Antamoshkin A.N., Kazakovtsev L.A., “Random Search Algorithm for the p-Median Problem”, Informatica, 37:2 (2013), 267–278
Kazakovtsev L.A., Antamoshkin A.N., “Genetic Algorithm with Fast Greedy Heuristic for Clustering and Location Problems”, Informatica, 38:3 (2014), 229–240
Kazakovtsev L.A., Stanimirovic P.S., “Algorithm for Weber Problem with a Metric Based on the Initial Fare”, Journal of Applied Mathematics and Informatics, 33:1-2 (2015), 157–172
V. N. Krutikov, P. S. Stanimirović, O. N. Indenko, E. M. Tovbis, L. A. Kazakovtsev, “Optimization of subgradient method parameters on the base of rank-two correction of metric matrices”, Diskretn. Anal. Issled. Oper., 29:3 (2022), 24–44
Contact us: