JSPM

Module that generates the unique combinations of key values by taking a single value from each keys array

A flexible pairwise tool written in TypeScript

Combinatorial explosion for arrays and trees

Combinatorial Test Case Generation

Ultra Mega Enumerator is a lightweight library designed to enumerate various combinatorial objects.

A metaheuristic algorithm development framework for solving discrete optimization problem

for efficient bitmasking operations, combinatorial problems, and set manipulations using bitwise operations.

Various tools for maintaining combinatorial embeddings of network graphs.

Generates combinations of things – useful for unit tests.

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

Calculate a small-ish list of combinations using `fast-cartesian`, then concatenate each result.

a PEG combinatorial parser

Methods for iterators