Lev Kazakovtsev

Orcid: 0000-0002-0667-4001

According to our database1, Lev Kazakovtsev authored at least 29 papers between 2012 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Hyper-Heuristic Approach for Tuning Parameter Adaptation in Differential Evolution.
Axioms, January, 2024

Heuristic Greedy-Gradient Route Search Method for Finding an Optimal Traffic Distribution in Telecommunication Networks.
Algorithms, 2024

2023
An Exploration and Exploitation-Based Metaheuristic Approach for University Course Timetabling Problems.
Axioms, August, 2023

Crossover Rate Sorting in Adaptive Differential Evolution.
Algorithms, March, 2023

Properties of the Quadratic Transformation of Dual Variables.
Algorithms, March, 2023

Visual Assessment of Cluster Tendency with Variations of Distance Measures.
Algorithms, January, 2023

Fuzzy Adaptive Parameter in the Dai-Liao Optimization Method Based on Neutrosophy.
Symmetry, 2023

Improvement of Unconstrained Optimization Methods Based on Symmetry Involved in Neutrosophy.
Symmetry, 2023

Subgroup Discovery in Machine Learning Problems with Formal Concepts Analysis and Test Theory Algorithms.
Algorithms, 2023

2022
Formation of Fuzzy Patterns in Logical Analysis of Data Using a Multi-Criteria Genetic Algorithm.
Symmetry, 2022

The Automatic Design of Multimode Resonator Topology with Evolutionary Algorithms.
Sensors, 2022

Calculating the Moore-Penrose Generalized Inverse on Massively Parallel Systems.
Algorithms, 2022

Clustering Algorithm with a Greedy Agglomerative Heuristic and Special Distance Measures.
Algorithms, 2022

2021
Self-Configuring (1 + 1)-Evolutionary Algorithm for the Continuous p-Median Problem with Agglomerative Mutation.
Algorithms, 2021

Machine Learning Algorithms of Relaxation Subgradient Method with Space Extension.
Proceedings of the Mathematical Optimization Theory and Operations Research, 2021

2020
Application of Algorithms with Variable Greedy Heuristics for k-Medoids Problems.
Informatica (Slovenia), 2020

Self-Adjusting Variable Neighborhood Search Algorithm for Near-Optimal k-Means Clustering.
Comput., 2020

2019
Identification of the Optimal Set of Informative Features for the Problem of Separating of Mixed Production Batch of Semiconductor Devices for the Space Industry.
Proceedings of the Mathematical Optimization Theory and Operations Research, 2019

2016
Combinations of the Greedy Heuristic Method for Clustering Problems and Local Search Algorithms.
Proceedings of the Supplementary Proceedings of the 9th International Conference on Discrete Optimization and Operations Research and Scientific School (DOOR 2016), Vladivostok, Russia, September 19, 2016

2014
Genetic Algorithm with Fast Greedy Heuristic for Clustering and Location Problems.
Informatica (Slovenia), 2014

Algorithms for Location Problems Based on Angular Distances.
Adv. Oper. Res., 2014

Fast genetic algorithm with greedy heuristic for p-median and k-means problems.
Proceedings of the 6th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, 2014

Genetic algorithm with greedy heuristic for capacity planning.
Proceedings of the 6th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, 2014

2013
Random Search Algorithm for the p-Median Problem.
Informatica (Slovenia), 2013

An Approach to the Multi-facility Weber Problem with Special Metrics.
Proceedings of the Seventh UKSim/AMSS European Modelling Symposium, 2013

2012
Parallel Random Search Algorithm of Constrained Pseudo-Boolean Optimization for Some Distinctive Large-Scale Problems
CoRR, 2012

Access Points Placement as a Discrete Optimization Problem
CoRR, 2012

Random constrained pseudo-Boolean optimization algorithm for multiprocessor systems and clusters.
Proceedings of the 4th International Congress on Ultra Modern Telecommunications and Control Systems, 2012

Algorithm for Approximate Solution of the Generalized Weber Problem with an Arbitrary Metric.
Proceedings of the Sixth UKSim/AMSS European Symposium on Computer Modeling and Simulation, 2012


  Loading...