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 …

This thesis introduces the novel paradigm of" constraint integer programming"(CIP), which
integrates constraint programming (CP) and mixed integer programming (MIP) modeling …

For many problems in scheduling and timetabling, the choice of a mathematical
programming formulation is determined by the formulation of the graph colouring …

We consider the vertex coloring problem, which can be stated as the problem of minimizing
the number of labels that can be assigned to the vertices of a graph G such that each vertex …

This paper presents a branch-and-cut algorithm for the NP-hard maximum feasible
subsystem problem: For a given infeasible linear inequality system, determine a feasible …

In this paper, we present matrix game-theoretic models for joint routing, network coding, and
scheduling problems. First, routing and network coding are modeled by using a new …

This paper presents a new generalization of the graph multicoloring problem. We propose a
Branch-and-Cut algorithm based on a new integer programming formulation. The cuts used …

The graph coloring problem is one of the most well-known problems in computer science.
Since it was one of the first problems demonstred to belong to the NP-Hard complexity class …

Abstract Let G=(V, E) be a simple graph on n nodes. We show how to construct a partial
subgraph D of the line graph of G satisfying the identity: χ (G)+ α (D)= n, where χ (G) denotes …

Uma k-coloração de um grafo G é a atribuição de uma dentre k cores a cada um dos
vértices de G de modo que dois vértices adjacentes em G não podem receber a mesma cor …