Alain Hertz

Retour

Cahiers du GERAD

113 résultats — page 4 de 6

, , et

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

référence BibTeX
, , et

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

référence BibTeX
, et

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

référence BibTeX
, et

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

référence BibTeX
, , et

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

référence BibTeX
, et

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

référence BibTeX
, , et

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

référence BibTeX
, , et

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

référence BibTeX
, et

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

référence BibTeX
, et

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

référence BibTeX
et

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

référence BibTeX
, , et

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

référence BibTeX
, et

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

référence BibTeX
, et

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

référence BibTeX
, , et

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

référence BibTeX
, et

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

référence BibTeX
, et

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

référence BibTeX
et

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

référence BibTeX
, , , et

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

référence BibTeX
et

Let <i>G = (V,E,w)</i> be a graph with vertex and edge sets <i>V</i> and <i>E</i>, respectively, and <i>w : E</i> <img src="/cgi-bin/mimetex.cgi?\rightarrow"...

référence BibTeX