A coloring traveling salesman problem (CTSP) generalizes the well-known multiple traveling
salesman problem, where colors are used to differentiate salesmen's the accessibility to …

Abstract The Traveling Salesman Problem (TSP) is a classical NP-hard combinatorial
optimization problem with many practical variants. The Lin–Kernighan–Helsgaun (LKH) …

The colored traveling salesmen problem is a node routing problem with multiple salesmen,
where the cities are divided into m exclusive city sets and one shared city set. The objective …

A colored traveling salesman problem (CTSP) is a generalization of the well-known multiple
traveling salesman problem, which introduces colors to distinguish the accessibility of its …

A colored traveling salesman problem (CTSP) is a generalization of the well-known multiple
traveling salesman problem. In it, each city has one to multiple colors and allows a salesman …

The minimum vertex cover (MVC) problem is a canonical NP-hard combinatorial
optimization problem aiming to find the smallest set of vertices such that every edge has at …

Given a simple and undirected graph, the maximum independent union of cliques (IUC)
problem aims to identify a subset of vertices with maximum cardinality, such that each …

In the realm of practical problem-solving, multi-objective optimisation problems with
redundant variables and indefinite objective functions (MOPRVIF) are becoming …

For a simple undirected weighted graph G=(V, E, w, c), the weighted total domination
problem is to find a total dominating set S with the minimum weight cost. A total dominating …

Minimum dominating set (MDS) is a well-known NP-hard fundamental graph theory problem
having many applications such as mining social networks and bioinformatics. MDS seeks for …