Metaheuristic algorithms are employed to solve complex and large‐scale optimization
problems in many different fields, from transportation and smart cities to finance. This paper …

The maximum happy vertices problem involves taking a simple graph in which several
vertices are precoloured. The aim is to colour the remaining vertices to maximise the number …

Matheuristics have been gaining in popularity for solving combinatorial optimisation
problems in recent years. This new class of hybrid method combines elements of both …

Over the last decades, so-called hybrid optimization approaches have become increasingly
popular for addressing hard optimization problems. In fact, when looking at leading …

Hybrid variations of metaheuristics that include data mining strategies have been utilized to
solve a variety of combinatorial optimization problems, with superior and encouraging …

This study considers the problem of resource constrained project scheduling to maximise
the net present value. A number of tasks must be scheduled within a fixed time horizon …

The multidimensional multi-way number partitioning problem takes as input a set of n
vectors with a fixed dimension m≥ 2, and aims to find a partitioning of this set into k≥ 2 non …

This work deals with the so-called weighted independent domination problem, which is an
NP-hard combinatorial optimization problem in graphs. In contrast to previous work, this …

This paper deals with an NP-hard string problem from the bio-informatics field: the repetition-
free longest common subsequence problem. This problem has enjoyed an increasing …

This paper considers single-machine just-in-time scheduling of jobs that may be grouped
into batches subject to a constraint on batches' weights. A job has a weight, due date, and …