4 papers
Lower Bound for (Sum) Coloring Problem
Alexandre Gondran, Vincent Duchamp, Laurent Moalic
The Minimum Sum Coloring Problem is a variant of the Graph Vertex Coloring Problem, for which each color has a weight. This paper presents a new way to find a lower bound of this p…
Optimality Clue for Graph Coloring Problem
Alexandre Gondran, Laurent Moalic
In this paper, we present a new approach which qualifies or not a solution found by a heuristic as a potential optimal solution. Our approach is based on the following observation:…
Multi-task learning of daily work and study round-trips from survey data
Mehdi Katranji, Sami Kraiem, Laurent Moalic +3
In this study, we present a machine learning approach to infer the worker and student mobility flows on daily basis from static censuses. The rapid urbanization has made the estima…
Variations on Memetic Algorithms for Graph Coloring Problems
Laurent Moalic, Alexandre Gondran
Graph vertex coloring with a given number of colors is a well-known and much-studied NP-complete problem.The most effective methods to solve this problem are proved to be hybrid al…