MIP alternatives and similar packages

Based on the "Algorithms" category.
Alternatively, view MIP alternatives based on common mentions on social networks and blogs.

build

9.6 3.1 MIP VS build

Build Systems à la Carte
arithmoi

9.5 6.2 MIP VS arithmoi

Number theory: primes, arithmetic functions, modular computations, special sequences

CodeRabbit: AI Code Reviews for Developers

Revolutionize your code reviews with AI. CodeRabbit offers PR summaries, code walkthroughs, 1-click suggestions, and AST-based analysis. Boost productivity and code quality across all major languages with each PR.

Promo coderabbit.ai

toysolver

9.3 9.3 MIP VS toysolver

My sandbox for experimenting with solver algorithms.
ersatz

8.9 5.4 MIP VS ersatz

A monad for interfacing with external SAT solvers
iproute

8.9 5.7 MIP VS iproute

IP Routing Table in Haskell
aeson-diff

8.5 0.0 MIP VS aeson-diff

Generate and apply diffs between JSON documents.
graphs

8.2 4.5 MIP VS graphs

a monadic graph library
primes

8.1 0.0 MIP VS primes

Prime Numbers for Haskell
funsat

8.1 0.0 MIP VS funsat

An efficient, embeddable DPLL SAT solver in Haskell
union-find

7.9 0.0 MIP VS union-find

DISCONTINUED. Efficient union and equivalence testing of sets.
imj-animation

7.9 0.0 MIP VS imj-animation

Monorepo for a multi-player game engine, and game examples
HMM

7.9 0.0 MIP VS HMM

hidden markov models in haskell
search-algorithms

7.9 3.2 MIP VS search-algorithms

Haskell library containing common graph search algorithms
text-metrics

7.8 4.7 MIP VS text-metrics

Calculate various string metrics efficiently in Haskell
presburger

7.7 0.0 MIP VS presburger

Decision procedures for Presburger arithmetic in Haskell
ADPfusion

7.4 5.1 MIP VS ADPfusion

Efficient, high-level dynamic programming
lca

7.4 2.1 MIP VS lca

Improves the known complexity of online lowest common ancestor search to O(log h) persistently, and without preprocessing
Adaptive

6.8 0.0 MIP VS Adaptive

Library for incremental computing.
dtw

6.6 0.0 MIP VS dtw

Implementation of Dynamic Time Warping in Haskell
ListTree

6.2 0.0 MIP VS ListTree

A List monad transformer and related tools
incremental-sat-solver

6.1 0.0 MIP VS incremental-sat-solver

Simple, Incremental SAT Solving as a Haskell Library
qchas

6.1 0.0 MIP VS qchas

DISCONTINUED. A library for implementing Quantum Algorithms
treeviz

6.1 0.0 MIP VS treeviz

Haskell library for visualizing algorithmic decomposition of computations.
edit-distance

6.0 0.0 MIP VS edit-distance

Edit distance library for Haskell
integer-logarithms

5.9 3.8 MIP VS integer-logarithms

Integer logarithms, originally split from arithmoi package
binary-search

5.7 0.0 MIP VS binary-search

Binary and exponential searches
cmaes

5.5 0.0 L1 MIP VS cmaes

CMA-ES wrapper in Haskell
sgd

5.5 0.0 MIP VS sgd

Stochastic gradient descent Haskell library
primal

5.5 0.0 MIP VS primal

Primitive World of Haskell
primesieve

5.2 3.8 MIP VS primesieve

A collection of packages related to math, algorithms and science, in Haskell.
twentyseven

5.0 0.0 MIP VS twentyseven

Rubik's cube solver in Haskell
GraphSCC

4.9 0.0 MIP VS GraphSCC

Tarjan's algorithm for computing strongly connected components
DP

4.6 0.0 MIP VS DP

Holder for a bunch of semirings used in ChartParsing
union-find-array

4.5 3.2 MIP VS union-find-array

ST based union find data structure
graph-generators

4.5 0.0 MIP VS graph-generators

A Haskell library for creating random Data.Graph instances using several pop
jps

4.4 0.0 MIP VS jps

:point_right: jump point search for Haskell
adp-multi

4.3 0.0 MIP VS adp-multi

Prototype of ADP for MCFL (multiple context-free languages)
infinite-search

4.2 0.0 MIP VS infinite-search

An implementation of Martin Escardo's exhaustively searchable sets in Haskell.
nonlinear-optimization-ad

4.1 6.7 MIP VS nonlinear-optimization-ad

Several Haskell packages for numerical optimizations.
edit-distance-vector

3.8 0.0 MIP VS edit-distance-vector

Calculate edit scripts and distances between Vectors.
pathfinding

3.7 0.0 MIP VS pathfinding

DISCONTINUED. Haskell pathfinding library
TrieMap

3.6 0.0 MIP VS TrieMap

Generalized tries for Haskell
KMP

3.5 0.0 MIP VS KMP

Knuth–Morris–Pratt string searching algorithm
spacefill

3.2 0.0 MIP VS spacefill

Space-filling curves
stable-marriage

2.7 1.1 MIP VS stable-marriage

library around stable marriage algorithms
fibonacci

2.7 0.0 MIP VS fibonacci

Fast computation of Fibonacci numbers in Haskell
dgim

2.7 0.0 MIP VS dgim

:chart_with_upwards_trend: Implementation of the DGIM algorithm in Haskell.
integer-roots

2.7 4.0 MIP VS integer-roots

Integer roots and perfect powers of arbitrary precision
edit-distance-linear

2.5 0.0 MIP VS edit-distance-linear

Levenshtein edit distance in linear memory (also turns out to be faster than C++)
pell

2.4 0.0 MIP VS pell

Haskell Package to solve the Generalized Pell Equation