Mixed-integer and 0-1 integer programming problems are NP-complete in the general case. You might as well use the backtracking approach which in my opinion is m

Mixed-integer and 0-1 integer programming problems are NP-complete in the general case. You might as well use the backtracking approach which in my opinion is much more elegant.