Enhancing computational efficiency in solving Knapsack problem: insights from algorithmic parallelization and optimization
<p>The Knapsack problem is a combinatorial optimization problem whose exact solution using exhaustive search method is impractical. Hence, the application of approximate algorithms is usually considered when encountering this optimization problem. This study optimized some approximate algorith...
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Academy Publishing Center
2024-08-01
|
| Series: | Advances in Computing and Engineering |
| Subjects: | |
| Online Access: | http://apc.aast.edu/ojs/index.php/ACE/article/view/885 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|