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...

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,.....

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...

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

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 ...