Performance of Selected Non-deterministic Algorithms Solving the Multidimensional Knapsack Problem
PDF

Keywords

knapsack problem, genetic algorithm, extended local branching, ant colony optimization, comparison

How to Cite

Pittner, J. (2023). Performance of Selected Non-deterministic Algorithms Solving the Multidimensional Knapsack Problem. Information Technology Applications, 1(2), 60–71. Retrieved from https://www.itajournal.com/index.php/ita/article/view/212

Abstract

The paper deals with the performance comparison of selected non-deterministic algorithms used for solving the multidimensional knapsack problem. After briefly explanation of these algorithms, we compare the results.

PDF
Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Copyright (c) 2012 International Journal of Information Technology Applications