Graph cover problems form a critical area within discrete optimisation and theoretical computer science, addressing the challenge of selecting subsets of vertices (or edges) that satisfy predetermined ...

Graph partitioning and bisection problems occupy a central position in combinatorial optimisation and theoretical computer science. These issues involve dividing a graph’s vertex set into distinct ...

We consider a nonlinear eigenvalue problem driven by the sum of p and q-Laplacians. We show that the problem has a continuous spectrum. Our result reveals a discontinuity property for the spectrum of ...

A significant body of recent literature has explored various research directions in hyper-heuristics (which can be thought as heuristics to choose heuristics). In this paper, we extend our previous ...