Abstract: This paper proposes a modified iterated greedy algorithm for solving an NP-hard knapsack problem known as the knapsack problem with setup. In contrast to the classical 0-1 knapsack problem, ...

Abstract: The Knapsack Problem is a classical combinatorial problem which can be solved in many ways. One of these ways is the Greedy Algorithm which gives us an approximated solution to the problem.

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 ...

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 ...

[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) ...