IEEE

Hybrid Quantum Search Algorithm for Solving the Multi-Dimensional Knapsack Problem

Abstract: The Multi-Dimensional Knapsack Problem (MDKP) is a strongly NP-Hard combinatorial optimization problem that extends the Knapsack Problem (KP) to multiple constraints. While effective ...
GitHub

This project is a Data Structures and Algorithms Visualization System developed using Java Swing. It visually demonstrates Stack, Queue, Linked List, and HashMap operations to ...

There was an error while loading. Please reload this page.
IEEE

Comparative study of metaheuristic algorithms using Knapsack Problem

Abstract: This paper aims to discuss and compare various metaheuristic algorithms applied to the “Knapsack Problem”. The Knapsack Problem is a combinatorial optimization maximization problem which ...