An open API service indexing awesome lists of open source software.

Projects in Awesome Lists tagged with knapsack-solver

A curated list of projects in awesome lists tagged with knapsack-solver .

https://github.com/renderedtext/test-boosters

Auto Parallelization - runs test files in multiple jobs

booster knapsack knapsack-solver semaphore-open-source

Last synced: 05 Apr 2025

https://github.com/hxndev/implementing-knapsack-algorithm

The knapsack problem is a problem in combinatorial optimization: Given a set of items, each with a weight and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible

code constraint-satisfaction-problem kanpsack-problem knapsack-problem knapsack-solver knative python

Last synced: 31 Mar 2025

https://github.com/raedaddala/or-solver

This is an Operations Research Course Project. This is a QT GUI that implements Knapsack and Transportation Cost Problem. We used Gurobi as A Solver.

gurobi gurobi-optimization gurobipy integer-linear-programming integer-programming knapsack knapsack-problem knapsack-solver linear-programming python qt qt5 transportation-problem

Last synced: 10 Feb 2026

https://github.com/yfe404/not-so-slow-knapsack

Multi-threaded Knapsack Solver - uses branch and bound and/or dynamic programming

knapsack knapsack-problem knapsack-solver multithreading operations-research optimization optimization-algorithms

Last synced: 14 May 2025

https://github.com/basemax/0-1knapsackrecursivec

This is an implementation of the 0-1 knapsack problem in C using a recursive approach. The problem consists of a set of items, each with a weight and a value, and a knapsack with a maximum weight capacity. The goal is to determine the subset of items that maximizes the total value of the knapsack without exceeding its weight capacity.

c knapsack knapsack-01 knapsack-problem knapsack-problem-recursive knapsack-recursive knapsack-solution knapsack-solver knapsack0-1 knapsack01

Last synced: 03 Apr 2025

https://github.com/basemax/0-1knapsackdynamicprogrammingc

This is an implementation of the 0-1 knapsack problem in C using dynamic programming. The problem consists of a set of items, each with a weight and a value, and a knapsack with a maximum weight capacity. The goal is to determine the subset of items that maximizes the total value of the knapsack without exceeding its weight capacity.

c knapsack knapsack-problem knapsack-problem-dynamic knapsack-solution knapsack-solver knapsack0-1 knapsack01

Last synced: 03 Apr 2025

https://github.com/glorkpixels/0-1-knapsack-fractional-knapsack-problem-solves

implementation of dynamic and greedy approach solution for a problem. Which is a car company that produces given amount of cars every month with investments, profits costs etc. Profits are from car sales and investments.

dynamic-analysis dynamic-programming greedy-algorithms greedy-best-first-search knapsack-problem knapsack-problem-greedy knapsack-solution knapsack-solver knapsack01

Last synced: 12 Apr 2025

https://github.com/jastka4/discrete-knapsack-problem-gui

Project for university. Programming in Java – advanced techniques (Exercise 1: Own library, javadoc, JavaFX and internationalization). JavaFX GUI implementation.

internationalization java java-11 javafx javafx-11 knapsack knapsack-solver knapsack01 openjdk11

Last synced: 30 Apr 2026

https://github.com/julio4/sac-a-dos

Class Project - Knapsack solver differents algorithms implementation in Java

algorithms class-project knapsack-problem knapsack-solver

Last synced: 03 Apr 2025

https://github.com/limitedeternity/knapsack

Просто рюкзаки. Разные: ограниченные и неограниченные

bounded-knapsack-problem knapsack-problem knapsack-solver unbounded-knapsack

Last synced: 14 Mar 2025

https://github.com/gpl27/soup

Genetic algorithm implementation for the 0-1 knapsack problem with choice restrictions

genetic-algorithm knapsack-solver python

Last synced: 11 Apr 2026

https://github.com/basemax/0-1knapsackgreedyc

This is an implementation of the 0-1 knapsack problem in C using a greedy algorithm. The problem consists of a set of items, each with a weight and a value, and a knapsack with a maximum weight capacity. The goal is to determine the subset of items that maximizes the total value of the knapsack without exceeding its weight capacity.

c greedy greedy-algorithm greedy-algorithms greedy-programming knapsack knapsack-01 knapsack-greedy knapsack-problem knapsack-problem-greedy knapsack-solver knapsack0-1 knapsack01

Last synced: 03 Apr 2025

https://github.com/jastka4/discrete-knapsack-problem

Project for university. Programming in Java – advanced techniques (Exercise 1: Own library, javadoc, JavaFX and internationalization).

java java-11 knapsack knapsack-problem-dynamic knapsack-problem-greedy knapsack-solver knapsack01

Last synced: 17 Oct 2025