mhrimaz/KnapsackFX

Solving Knapsack 0/1 problem with various Local Search algorithms like Hill Climbing, Genetic Algorithms, Simulated Annealing, Tabu Search

/ 100

Experimental

No commits in the last 6 months.

Stale 6m No Package No Dependents

Maintenance 0 / 25

Adoption 7 / 25

Maturity 9 / 25

Community 12 / 25

Stars

Forks

Language

Java

License

MIT

Category

Last pushed

May 11, 2017

Commits (30d)

Get this data via API

curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/mhrimaz/KnapsackFX"

Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.

Higher-rated alternatives

pdrm83/py2opt

How to solve the traveling salesman problem with the 2-opt algorithm, a fast heuristic search algorithm.

aimclub/SAMPO

Open-source framework for adaptive manufacturing processes scheduling

yining043/TSP-improve

An improvement-based Deep Reinforcement Learning Algorithm presented in paper...

albert-espin/knapsack-packing

Evolutionary Algorithm for the 2D Packing Problem combined with the 0/1 Knapsack Problem (Master Thesis)

Sinclert/Heuristics-TSP

Travelling Salesman Problem solution 🚚