Knapsack Packages

Get CI environment variables for parallelizing builds

Knapsack Pro Core library splits tests across CI nodes and makes sure that tests will run in optimal time on each CI node. This library gives core features like communication with KnapsackPro.com API. This library is a dependency for other projects specif

Knapsack Pro Cypress splits Cypress.io tests across CI nodes and makes sure that tests will run in optimal time on each CI node.

Build Design Systems with Knapsack

Knapsack Pro Jest splits Jest tests across CI nodes and makes sure that tests will run in optimal time on each CI node.

bin-packing algorithms

A program for solving the Stock Cutting Problem.

A module for resource allocation solving

A handy bag of sass utilities and mixins

Knapsack Pro custom runner for Gherkin/Testcafe

Decoder, Encoder and Cracker for Merkle–Hellman knapsack cryptosystem

This module contains a closure built on a genetic algorithm that allows you to rapidly spawn optimized NBA FanDuel lineups.

Lightweight, flexible, and efficient solution for knapsack problems. This is definitely what you are looking for.

Rectpack-ts is a TypeScript library that implements heuristic algorithms for solving the 2D knapsack problem, also known as the bin packing problem. This involves packing a set of rectangles into the smallest number of bins.

Solves a variation of knapsack problem. Target is to fulfill `capacity` using values from the `values` array while minimizing overflow over `capacity`.

A Node-RED node that load balances electric consumption based on the knapsack algorithm.

A Node-RED node that demonstrates the use of the Knapsack algorithm

Solve the unbounded knapsack problem and its dual version

The Fastest and Smallest Subset finder. Finds all subsets from an array that equal a target number. In O(N log N) time and 2N+2 Space.