Alain Quilliot

Learn More
On a finite simple graph G = (X, E), p players pursuers A,, ‘., A, and one player evader B who move in turn along the edges of G are considered. The p pursuers A,, .‘., A, want to catch B who tries to escape. R. Nowakowski and P. Winkler [Discrete Math. 43 (1983), 235-2401 and A. Quilliot [“These de 3’cycle,” pp. 131-145, Universite de Paris VI, 19781(More)
Such a concept aims to formalize some problems related to points or intervals drawn on a circle or on the plane, or with geometric representations of finite groups «a, b, c) e F is to be read as 'b is located between a and c'). We move into the context of the so defined ternary relation some classical questions arising in the theory of partially ordered(More)
This paper presents a Particle SwarmOptimization (PSO) algorithm for solving Resource-Constrained Project Scheduling Problems (RCPSP). The PSO model is a new population based optimization strategy introduced by Kennedy and Eberhart in 1995. The PSO is a cooperative and competitive algorithm who belongs to the class of the evolutionary algorithms. We here(More)
The paper addresses a multi-item, multi-plant lot-sizing problem with transfer costs and capacity constraints. The problem is reformulated according to a multi-commodity flow formalism, and decomposed, through Lagrangean relaxation, into a master facility location problem and a slave minimal cost multi-commodity flow problem. The decomposition framework(More)
In this paper, the RCPSP (Resource Constrained Project Scheduling Problem) is solved using a linear programming model. Each activity may or may not be preemptive. Each variable is associated to a subset of independent activities (antichains). The properties of the model are first investigated. In particular, conditions are given that allow a solution of the(More)