Skrypt python służący do wizualizacji i rozwiązywania problemu plecakowego, wykorzystująca matplotlib, numpy oraz pandas do analizy i graficznego przedstawienia optymalnych kombinacji wag i wartości przedmiotów. Idealny do wizualizacji problemu co ułatwi jego zrozumienie oraz naukę.

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.

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

Class Project - Knapsack solver differents algorithms implementation in Java

Solver for Multiple Knapsack Problem Variations

A solution to the Knapsack problem as an API using Spring, Java 11, and Gradle.

Rede neural do tipo perceptron, de camada única. O objetivo é treinar de forma rápida e eficiente uma rede neural que poss classificar um tipo de planta em 3.

This project seeks to explore the famed knapsack problem in a 3D context using "parcels" shaped as pentominoes (shapes only one size unit larger than those of the famed tetrominoes from tetris) holding different values to maximise value while filling a theoretical cargo space with various algorithms.

Solving Knapsack Problem

Efficient implementations of simple branch and bound and dynamic programming algorithms for 0-1 and unbounded Knapsack problems.

This repository includes a study that aims to handle the knapsack problem with recursive-methods and dynamic-programming paradigm. Detailed info in ReadMe

Auto Parallelization - runs test files in multiple jobs

Generation of solutions from binary numbers in the C language, which can be used for various purposes.

Knap Sack Problem Backtracking

KnapSackProblem

New exact algorithms for integer and rational numbers: unbounded 1-0 M dimensional knapsack, N way sum partition, T group N sum partition, and MKS problems in Python3 and C++.

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.

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.

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.

Graphic interface for testing genetics.js framework in the client using React