Abstract: The multiple-choice multidimensional knapsack problem (MMKP) is a well-known NP-hard problem that has many real-time applications. However, owing to its complexity, finding computationally ...

I'm a software developer and writer, passionate about learning and sharing knowledge and one way I do that is through writing. I'm a software developer and writer, passionate about learning and ...

The best algorithm for a computational problem generally depends on the “relevant inputs,” a concept that depends on the application domain and often defies formal articulation. Although there is a ...

Implementation of simulated annealing algorithm for the multiple choice multidimensional knapsack problem. The multiple choice knapsack problem has n groups of items and m constraints. The objective ...

The "knapsack problem" is a widespread computing challenge—and no, it doesn't have to do just with literal backpacks. golubovy / iStock Imagine you’re a thief robbing a museum exhibit of tantalizing ...

[Ahuja00] “A greedy genetic algorithm for the quadratic assignment problem”, R. Ahuja, J. Orlin, A. Tiwari, Computers and Operations Research, vol. 27, issue 10 (Sept. 2000), 917--934, ACM (2000) ...

ABSTRACT: The 0/1 Multidimensional Knapsack Problem (0/1 MKP) is an interesting NP-hard combinatorial optimization problem that can model a number of challenging applications in logistics, finance, ...