Abstract: In this paper, we propose to solve the max-min multiple knapsack problem by using an exact solution search. An instance of the problem is defined by a set of n items to be packed into m ...
Customer stories Events & webinars Ebooks & reports Business insights GitHub Skills ...
There was an error while loading. Please reload this page.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results