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 ...
Persistent Link: https://ieeexplore.ieee.org/servlet/opac?punumber=52 ...
Customer stories Events & webinars Ebooks & reports Business insights GitHub Skills ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results