The Storage Location Assignment Problem in warehousing have been seldomly tackled by exact methods when considering the exact demand over a time horizon (e.g. the set of orders with different items to retrieve). In this presentation we present a novel extended formulation of the problem that is independant from both: i. the warehouse layout and ii. The picker routing policy. These two aspects are convexified in the subproblems. This formulation is solved by a column-generation algorithm with decomposed pricing problems, embedded in a Branch-Cut-and-Price. Several polynomial and exponential families of valid inequalities are derived to enhance the resolution framework. Preliminary results show a major improvement of the dual bound between a compact mixed-integer formulation and the extended one. The results of the Branch-Cut-and-Price algorithm are competitive compared to commercial solvers. Further work is ongoing to further speed-up the solution method.