Displaying 1 result from an estimated 1 matches for "wrost".
Did you mean:
worst
2012 Aug 03
0
Binary Quadratic Opt
...er even after running for a full day. I plan to solve for node size upto atleast 100, so I guess I need to do something fundamentally different.
> >> >
> >> > Now I understand that lpSolve is using Branch and Bound Algorithm which to me looks highly inefficient, for in the wrost case it will try to solve 2^n LP relaxation problem. Maybe that's why I do not get answer even when n=16. So what do I do to make lpSolve solve problem efficiently.
> >>
> >> Integer linear programming is an NP-complete problem and in general requires an
> >> expon...