Nicolas Zufferey

Back

Cahiers du GERAD

5 results — page 1 of 1

G-2008-29
La coloration des sommets d'un graphe par colonies de fourmis
and

Le texte qui suit est un chapitre du livre intitulé <i>Fourmis artificielles, des bases algorithmiques aux concepts et réalisations avancés</i>, Nicolas Monm...

BibTeX reference
G-2006-81
Variable Space Search for Graph Coloring
, , and

Let <i>G = (V,E)</i> be a graph with vertex set <i>V</i> and edge set <i>E</i>. The <i>k</i>-coloring problem is to assign a color (a number chosen in {1,.....

BibTeX reference
G-2006-59
A Solution Method for a Car Fleet Management Problem with Maintenance Constraints
, , and

The problem retained for the ROADEF’99 international challenge was an inventory management problem for a car rental company. It consists in managing a given...

BibTeX reference
G-2003-42
Lower Bounding and Tabu Search Procedures for the Frequency Assignment Problem with Polarization Constraints
, , and

The problem retained for the ROADEF'2001 international challenge was a frequency assignment problem with polarization constraints (FAPP). This NP-hard probl...

BibTeX reference
G-2003-35
An Adaptive Memory Algorithm for the k-Colouring Problem
, , and

Let <i>G</i>=(<i>V,E</i>) be a graph with vertex set <i>V</i> and edge set <i>E</i>. The <i>k</i>-colouring problem is to assign a colour (a number chosen ...

BibTeX reference