TOTO

how to find the complexity of a formulation ( in terms of constraints and variables) (we refer generally to the notation (o(n^2) variables and o(n^3) constraints) ( i would be grateful if you mention links or examples explaining this question) - how can we justify a large gap in execution time for two formulations of the same complexity ?