In the Multi-Commodity two-echelon Distribution Problem (MC2DP) multiple commodities are collected from the suppliers, sent to the distribution centres for consolidation purposes and delivered to the customers to fulfill their requests. The collection operations are performed by an unlimited fleet of homogeneous capacitated vehicles with direct trips from the suppliers to the distribution centres. Conversely, each distribution centre owns an unlimited fleet of homogeneous capacitated vehicles performing routes to deliver the commodities to the customers. All vehicles can transport any set of commodities as long as their capacity is not exceeded. In addition, as in the Commodity constrained Split Delivery Vehicle Routing Problem (C-SDVRP), customers can be visited multiple times. However the request for a given commodity has to be delivered in a single visit. The aim of the MC2DP is to minimize the overall transportation cost. We propose an exteded formulation for the problem and a branch-price-and-cut algorithm to solve it which incorporates several classical and advanced speed-up techniques.