This paper surveys the most important algorithmic and computational results on the Vertex
Coloring Problem (VCP) and its generalizations. The first part of the paper introduces the …

Variable neighborhood search (VNS) is a metaheuristic for solving combinatorial and global
optimization problems whose basic idea is a systematic change of neighborhood both within …

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

Graph colouring is one of those rare examples in the mathematical sciences of a problem
that, while easy to state and visualise, has many aspects that are exceptionally difficult to …

Graph vertex coloring is one of the most studied NP-hard combinatorial optimization
problems. Given the hardness of the problem, various heuristic algorithms have been …

Given an undirected graph G=(V, E) with a set V of vertices and a set E of edges, the graph
coloring problem consists of partitioning all vertices into k independent sets and the number …

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

Firefly algorithms belong to modern meta-heuristic algorithms inspired by nature that can be
successfully applied to continuous optimization problems. In this paper, we have been …

This paper addresses the capacitated location-routing problem (CLRP), raised by
distribution networks involving depot location, fleet assignment and routing decisions. The …

Using the semi-tensor product of matrices, this paper investigates the maximum (weight)
stable set and vertex coloring problems of graphs with application to the group consensus of …