Combinatorial problems can be difficult to formulate, and even more difficult to solve. Often, they are NP-Complete.

The Enumeration Sieve tool is designed for these problems, moving smoothly from brute force enumeration (for small problems), to dynamic-programming style pruning of the solution space, to a greedy heuristic able to find good solutions in reasonable amounts of compute time.

The language parsed by solver is straight-forward; a series of decisions, each with a set of discrete options and variables, form the problem structure. The solution space is explored in breadth-first manner, with a variety of pruning techniques available.

This app is most appropriate for people familiar with combinatorial optimization, and in particular the use of Pareto-front pruning.