Big O Complexity for Solving NP-hard Problem

Question

I have an NP-hard optimization problem that I formalized as mixed-integer linear program (MILP) and that I\'m solving (for small inputs) with Gurobi.

I understand tha