Trains running through railway lines often accumulate some delay. When this happens, rescheduling and rerouting decisions must be quickly taken in real time. Despite the fact that even a single wrongâ€¦ (More)

Single Machine Scheduling Problems with Release Dates (SMSP) concern the optimal allocation of a set of jobs on a single machine, that cannot process more than one job at a time. Each job is readyâ€¦ (More)

The p-median problem (PMP) consists of locating p facilities (medians) in order to minimize the sum of distances from each client to the nearest facility. The interest in the large-scale PMP arisesâ€¦ (More)

The Capacitated Facility Location Problem (CFLP) is to locate a set of facilities with capacity constraints, to satisfy at the minimum cost the order-demands of a set of clients. A multi-sourceâ€¦ (More)

In the management and control of a vehicle fleet on a road network, the problem arises of finding the best route in relation to the mission of the fleet and to the typology of freight or users.â€¦ (More)

The multilevel generalized assignment problem (MGAP) consists of minimizing the assignment cost of a set of jobs to machines, each having associated therewith a capacity constraint. Each machine canâ€¦ (More)

The Capacitated Facility Location Problem is to locate a set of facilities with capacity constraints, with the aim of satisfying at the minimum cost the demands of a set of clients. The Single Sourceâ€¦ (More)