Department of Chemical Engineering, Auburn University, Auburn, Alabama 36849, United States Article Views are the COUNTER-compliant sum of full text article downloads since November 2008 (both PDF and ...

Abstract: In this paper a new optimization algorithm based on ant colony metaphor (ACO)and a new approach for the Multiple Knapsack Problem is presented. The MKP is the problem of assigning a subset ...

A Python implementation of a branch-and-bound approach (plus a simple greedy heuristic) to solve a variation of the multiple knapsack problem where items have both individual and pairwise benefits.

This repository was created for the subject of Computer Theory. The propose of this subject is to improve your skills to solve the 0-1 knapsack problem of different ways. The techniques used were ...

1 Lingnan College, Sun Yat-sen University, Guangzhou, China. 2 School of Economic and Business Administration, Chongqing University, Chongqing, China. The nonlinear multidimensional knapsack problem ...

1 Department of Mathematical Sciences, United States Military Academy, West Point, USA. 2 Industrial and Manufacturing Systems Engineering Department, Kansas State University, Manhattan, USA.

Abstract: The multiple knapsack problem is to pack some items into given knapsacks, such that the sum of the knapsack profits is maximized. This paper is concerned with a variant of the multiple ...