Background: Nowadays, biological samples often contain dna of several species or individuals. When sequenced, we loose the origin of each fragments of dna and their position on the molecule. The problem of associating a dna fragment to a version of the genome and to find its position is called the haplotyping problem. Results: In this report, we present two new Mixed Integer Linear Programming (milp) methods based on multicommodity-flow to solve this problem. Unlike previous approaches, the resolution avoid the use of heuristics by using global optimisation. Conclusion: We do not currently known the quality of our results. However, proposed a comparison between the solving time complexity of our two milp models. We also proposed an experimental protocol to test the solution quality.