Originally posted by: SystemAdmin
[cplex_ma said:]
Hi All,
I have a problem with the following description that I would like to find out its complexity.
Consider that I have n varibales and k+p=n, where k variables are only binary and p varibales are integers between 0 and J. First of all, is such a problem still considred an Integer programming?
Secondly, what is the worst-case complexity? is it still 2^n?
Thanks,
#CPLEXOptimizers#DecisionOptimization