In this paper, we introduce knapsack problem formulations, discuss their time complexity and propose their representation and solution based on the instance size. First, deterministic methods are briefly summarized. They can be applied to small-size tasks with a single constraint. However, because of NP-completeness of the problem, more complex problem instances must be solved by means of heuristic techniques to achieve an approximation of the exact solution in a reasonable amount of time. The problem representations and parameter settings for a genetic algorithm and simulated annealing frameworks are shown.
CITATION STYLE
Šeda, M., & Šeda, P. (2019). Stochastic heuristics for knapsack problems. In Advances in Intelligent Systems and Computing (Vol. 837, pp. 157–166). Springer Verlag. https://doi.org/10.1007/978-3-319-97888-8_14
Mendeley helps you to discover research relevant for your work.