We consider a static decision model related to the management of a Dial-a-Ride (DAR)
system involving small autonomous electrical vehicles in a closed industrial site. Because of …

This paper addresses the weighted vertex coloring problem (WVCP) which is an NP-hard
variant of the graph coloring problem with various applications. Given a vertex-weighted …

Abstract In Vertex Coloring Problems, one is required to assign a color to each vertex of an
undirected graph in such a way that adjacent vertices receive different colors, and the …

Graph coloring is an important problem in combinatorial optimization and a major
component of numerous allocation and scheduling problems. In this paper we introduce a …

Given an undirected graph, the Vertex Coloring Problem (VCP) consists of assigning a color
to each vertex of the graph in such a way that two adjacent vertices do not share the same …

The graph coloring problem appears in numerous applications, yet many state-of-the-art
methods are hardly applicable to real world, very large, networks. The most efficient …

It is known that the problem of proper coloring of the nodes of a given graph can be reduced
to finding cliques in a suitably constructed auxiliary graph. In this work, we explore the …

We introduce a new facet-generating procedure for the stable set polytope, based on
replacing (k− 1)-cliques with certain k-partite graphs, which subsumes previous procedures …

It is known that the legal coloring of the nodes of a given graph can be reduced to a clique
search problem. This paper generalizes this result for hypergraphs. Namely, we will show …

Given an undirected graph, the Vertex Coloring Problem (VCP) consists of assigning a color
to each vertex of the graph such that two adjacent vertices do not share the same color and …