Learn More
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 already characterized the graphs such that one pursuer is sufftcient to catch(More)
This paper presents a Particle Swarm Optimization (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)
In this paper, we consider a variant of the pickup and delivery problem where any demand may be dropped off elsewhere than at its destination, picked up later by the same or another vehicle, and so on until it has reached its destination. We discuss the complexity of this problem and present two mixed-integer linear programming formulations based on a(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)