Let G = (N,E) be an undirected graph where N is the set of nodes and E, the set of edges. Let C be a symmetrical distance matrix defined on N² an...

This paper describes an automatic procedure for constructing examination timetables in universities. The program produces schedules in which there are no co...

Le problème considère un ensemble de parcours ayant chacun un lieu de début, un lieu de fin, une durée, un coût et un intervalle de temps pendant lequel ils ...

Le service de transport des handicapés vise à procurer un transport à toute personne handicapée incapable d'utiliser le service de transport urbain régulier....

This paper considers a version of the vehicle scheduling problem (VSP) in which a non-negative weight is assigned to each city to be visited and where all ve...

This paper considers a version of the vehicle routing problem in which a non-negative weight is assigned to each city to be visited and where all vehicles ar...

This paper considers a version of the vehicle routing problem in which all vehicles are identical and where the distance travelled by any vehicle may not exc...

Le problème classique de l'industrie du papier consiste à générer un programme de coupe de façon à satisfaire les demandes des clients, tout en minimisant le...

When an electoral map is set up, various socio-economical, political and geographical parameters are taken into consideration. To evaluate the importance of...