Various implementations of algorithms for solving the knapsack problem.
-
Updated
Dec 8, 2024 - R
Various implementations of algorithms for solving the knapsack problem.
Implementations of the Euclidean algorithm, which calculates the greatest common divisor of two integers, and Dijkstra's algorithm, used for finding the shortest path in a graph.
Handling linear regression models through the utilization of QR decomposition, as well as ridge regression models.
Add a description, image, and links to the 732a94 topic page so that developers can more easily learn about it.
To associate your repository with the 732a94 topic, visit your repo's landing page and select "manage topics."