HIGHLIGHTS
- who: Knapsack Problems and colleagues from the School of Information Science and Technology, Qingdao University of Science and Technology, Department of Computer Science and Technology, Ocean University of China, Qingdao, China have published the Article: A Novel Monarch Butterfly Optimization with Global Position Updating Operator for Large-Scale 0-1, in the Journal: (JOURNAL)
- what: The aim of the 0-1 KP is to maximize the total profits of the items placed in the knapsack, subject to the condition that the sum of the weights of the corresponding items does not exceed a given capacity . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.