Alain Hertz
BackCahiers du GERAD
114 results — page 4 of 6
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
In this paper we present a simple technique that uses background information to improve mining the frequent patterns of structured data. This technique uses ...
BibTeX referenceSyGMA: Reducing Symmetry in Graph Mining
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...
BibTeX reference
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...
BibTeX reference
<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...
BibTeX reference
This paper proposes to use local search inside filtering algorithms of combinatorial structures for which achieving a desired level of consistency is too c...
BibTeX referenceOn a Reduction of the Interval Coloring Problem to a Series of Bandwidth Coloring Problems
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 ...
BibTeX reference
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...
BibTeX reference
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...
BibTeX reference
We consider the bandwidth coloring problem, a generalization of the well-known graph coloring problem. For the latter problem, a classical theorem, discover...
BibTeX reference
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...
BibTeX reference
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...
BibTeX referenceUsing Meta-Heuristics to Find Minimal Unsatisfiable Subformulas in Satisfiability Problems
In this paper, we propose efficient algorithms to extract minimal unsatisfiable subsets of clauses or variables in unsatisfiable propositional formulas. Suc...
BibTeX reference
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...
BibTeX referenceVariable Space Search for Graph Coloring
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
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...
BibTeX reference
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
We consider the problem of orienting the edges of a graph so that the length of a longest path in the resulting digraph is minimum. As shown by Gallai, Roy ...
BibTeX referenceThe Metric Cutpoint Partition Problem
Let <img src="/cgi-bin/mimetex.cgi?G = (V,E,w)"> be a graph with vertex and edge sets <img src="/cgi-bin/mimetex.cgi?V"> and <img src="/cgi-bin/mimetex.cgi?E...
BibTeX reference
We analyze a territorial approach to deliver nursing home care services to a territory public health. We present the case of the CSSS assigned to Côte-des-N...
BibTeX reference