GitHub / mustafa-droid18 / Solving-the-0-1-Knapsack-Problem-Using-the-LAB-Algorithm
This repository implements the LAB (Leader Advocate Believer) Algorithm to solve the 0-1 Knapsack Problem, a classic optimization problem. The LAB Algorithm is inspired by human social interactions, simulating the roles of leaders, advocates, and believers to efficiently explore and exploit the solution space.
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mustafa-droid18%2FSolving-the-0-1-Knapsack-Problem-Using-the-LAB-Algorithm
PURL: pkg:github/mustafa-droid18/Solving-the-0-1-Knapsack-Problem-Using-the-LAB-Algorithm
Stars: 0
Forks: 0
Open issues: 0
License: None
Language: Jupyter Notebook
Size: 1.82 MB
Dependencies parsed at: Pending
Created at: about 2 years ago
Updated at: over 1 year ago
Pushed at: over 1 year ago
Last synced at: over 1 year ago
Topics: meta-heuristic-algorithms, meta-heuristic-optimization, optimization-algorithms