In this paper, we aim at making appear the way Flow and Multicommodity Flow Theory may be used in order to deal with combinatorial geometry problems like the 2D-Bin Packing problem. In order to do it, we introduce a notion of no circuit double flow, we state a Reformulation Theorem which ties some multicommodity flow model with a given bin-packing problem, and we provide an algorithm whose purpose is to study the way one may deal with the no circuit constraint which is at the core of our multicommodity flow.
