We consider an inventory routing problem in discrete time where a supplier has to serve a set of customers over a time horizon. A capacity constraint for th...

A profit and a demand are associated with each arc of a set of profitable arcs of a given graph. A travel time is associated with each arc of the graph. A fl...

A magnet is a pair <i>u,v</i> of adjacent vertices such that the proper neighbours of <i>u</i> are completely linked to the proper neighbours of <i>v</i>. It...

With the help of the Graffiti system, Fajtlowicz conjectured around 1992 that the average distance between two vertices of a connected graph <i>G</i> is at ...

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

In this paper we present a simple technique that uses background information to improve mining the frequent patterns of structured data. This technique uses ...

While recent algorithms for mining the frequent subgraphs of a database are efficient in the general case, these algorithms tend to do poorly on databases th...

Flexibility in workforce planning is one of the best ways to respond to fluctuations of the demand. This paper proposes a flexible mixed integer linear pro...

<p> Given a graph <i>G=(V,E)</i> with strictly positive integer weights <img src="/cgi-bin/mimetex.cgi?\omega_i"> on the vertices <img src="/cgi-bin/mimete...

This paper proposes to use local search inside filtering algorithms of combinatorial structures for which achieving a desired level of consistency is too c...

Given a graph <img src="/cgi-bin/mimetex.cgi?G=(V,E)"> with strictly positive integer weights <img src="/cgi-bin/mimetex.cgi?\omega_i"> on the vertices <img ...

Given a class of graphs <img src="/cgi-bin/mimetex.cgi?\mathcal{F}">, a forbidden subgraph characterization (FSC) is a set of graphs <img src="/cgi-bin/mimet...

In this paper we study the Capacitated Team Orienteering and Profitable Tour Problems (CTOP and CPTP). The interest in these problems comes from recent devel...

We consider the bandwidth coloring problem, a generalization of the well-known graph coloring problem. For the latter problem, a classical theorem, discover...

An edge coloring of a graph <img src="/cgi-bin/mimetex.cgi?G = (V,E)"> is a function <img src="/cgi-bin/mimetex.cgi?c:E \rightarrow N"> that assigns a co...

We consider the problem of assigning patients to nurses for home care services. The aim is to balance the workload of the nurses while avoiding long travels...

In this paper, we propose efficient algorithms to extract minimal unsatisfiable subsets of clauses or variables in unsatisfiable propositional formulas. Suc...

We consider the problem of determining the size of a maximum clique in a graph, also known as the clique number. Given any method that computes an upper bou...

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

Given a set of timetabled tasks, the multi-depot vehicle scheduling problem is a wellknown problem that consists of determining least-cost schedules for veh...