Simple LP solver based on http://en.
Algorithms for finding a bipartite matching.
Solve argmin (a dot x + .
DSL for LinearPrograms.
mixed 0-1 ILP Solver based on Branch and bound
InteriorPoint solver for LPs.
Algorithm to find a minimum cost matching on a bipartite graph.