Variable neighbourhood search (VNS) is a metaheuristic, or a framework for building
heuristics, based upon systematic changes of neighbourhoods both in descent phase, to …

Variable neighbourhood search (VNS) is a metaheuristic, or a framework for building
heuristics, based upon systematic changes of neighbourhoods both in descent phase, to …

Though empirical testing is broadly used to evaluate heuristics, there are shortcomings with
how it is often applied in practice. In a systematic review of Max-Cut and quadratic …

Solutions to real-life optimization problems usually have to be evaluated considering
multiple conflicting objectives. These kind of problems, known as multi-objective …

Population-based evolutionary algorithms usually manage a large number of individuals to
maintain the diversity of the search, which is complex and time-consuming. In this paper, we …

We study the minimum st-cut problem in graphs with costs on the edges in the context of
evolutionary algorithms. Minimum cut problems belong to the class of basic network …

In this paper, we investigate the Max-Cut problem and propose a probabilistic heuristic to
address its classic and weighted version. Our approach is based on the Estimation of …

There exists a wide variety of network problems where several connection requests occur
simultaneously. In general, each request is attended by finding a route in the network, where …

Learning the problem structure at multiple levels of coarseness to inform the decomposition-
based hybrid quantum-classical combinatorial optimization solvers is a promising approach …

Ant Colony Optimization (ACO) is a powerful metaheuristic for solving combinatorial
optimization problems. With this paper we contribute to the theoretical understanding of this …