1 citations · 1 across the 3 of their papers we have counts for
4 papers
A Probabilistic Ant-based Heuristic for the Longest Simple Cycle Problem in Complex Networks
David Chalupa, Phininder Balaghan, Ken A Hawick
We propose a new probabilistic ant-based heuristic (ANTH-LS) for the longest simple cycle problem. This NP-hard problem has numerous real-world applications in complex networks, in…
Instance Scale, Numerical Properties and Design of Metaheuristics: A Study for the Facility Location Problem
David Chalupa, Peter Nielsen
Metaheuristics are known to be strong in solving large-scale instances of computationally hard problems. However, their efficiency still needs exploration in the context of instanc…
An Order-based Algorithm for Minimum Dominating Set with Application in Graph Mining
David Chalupa
Dominating set is a set of vertices of a graph such that all other vertices have a neighbour in the dominating set. We propose a new order-based randomised local search (RLS) a…
An Analysis of a Simple Local Search Algorithm for Graph Colouring
David Chalupa
Vertex Descent is a local search algorithm which forms the basis of a wide spectrum of tabu search, simulated annealing and hybrid evolutionary algorithms for graph colouring. Thes…