In this paper we propose new calculi for the multiplicative fragment of Mixed Linear Logic (MMLL) which is a logic that combines both commutative and non-commutative connectives. These based-on sequent and proof net calculi, that can be seen as a new proof-theoretical formulation of MMLL, are based on the definition of dependency relations. We provide a proof-search procedure for MMLL that is based on proof nets construction with associated sets of dependencies.