In this study, an aggregated flow formulation and a column generation strategy are proposed for the Strong Network Orientation Problem (SNOP) that consists in setting an orientation for each edge in a given graph, such that the resulting digraph is strongly connected and the total travel distance between all pairs of vertices is minimized. SNOP is NP-hard and finds application in urban networks.