Le problème du voyageur de commerce (PVC) symétrique consiste à déterminer le cycle le plus court passant exactement une fois par chacun des noeuds d'un grap...

This paper consider the problem of determining the shortest circuit or cycle in a graph containing n nodes and such that (i) each of k nodes (k ≤ n) i...

This paper shows the existence of a class of valid inequalities for two types of vehicle routing problems. These inequalities constitute a generalization of...

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

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

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