9 citations · 10 across the 4 of their papers we have counts for
4 papers
Conditional Markov Chain Search for the Simple Plant Location Problem improves upper bounds on twelve Körkel-Ghosh instances
Daniel Karapetyan, Boris Goldengorin
We address a family of hard benchmark instances for the Simple Plant Location Problem (also known as the Uncapacitated Facility Location Problem). The recent attempt by Fischetti e…
Efficient Adaptive Implementation of the Serial Schedule Generation Scheme using Preprocessing and Bloom Filters
Daniel Karapetyan, Alexei Vernitski
The majority of scheduling metaheuristics use indirect representation of solutions as a way to efficiently explore the search space. Thus, a crucial part of such metaheuristics is…
Design, Evaluation and Analysis of Combinatorial Optimization Heuristic Algorithms
Daniel Karapetyan
Combinatorial optimization is widely applied in a number of areas nowadays. Unfortunately, many combinatorial optimization problems are NP-hard which usually means that they are un…
An Efficient Hybrid Ant Colony System for the Generalized Traveling Salesman Problem
Mohammad Reihaneh, Daniel Karapetyan
The Generalized Traveling Salesman Problem (GTSP) is an extension of the well-known Traveling Salesman Problem (TSP), where the node set is partitioned into clusters, and the objec…