Given a simple graph G(V, E) and a set of traffic demands between the nodes of G, the Network Loading Problem consists of installing minimum cost integer capacities on the edges of G allowing routing… (More)

In this paper we describe a successful case-study where a Branch-and-Cut algorithm yields the “optimal” solution of a real-world timetabling problem for university courses (University Course… (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 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)

Preprocessing plays a crucial role in solving combinatorial optimization problems. It can be realized through reduction tests which allow one to determine in advance the values that a set of… (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)

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)