La determinazione degli itinerari delle vetture in un'impresa di servizi pubblici automobilistici

We propose a variant of a well known problem of Dantzig and Fulkerson in linear programming, to determining the most economical set of journeys for a public transport company in daily service (e.g.: a bus company). We also show an interesting property of such a problem, namely: under certain conditions it can be partitioned into several distinct sub-problems whose solutions can be optimized singly, the set of which then being the optimal solution for the problem assigned.