New Blog Articles

by Yubo "Paul" Yang

Linear Sum Assignment

The Linear Sum Assignment Problem (LSAP) is a combinatoric optimization problem with many practical applications. An elegant solution was proposed in 1955 by Kuhn and lovingly dubbed "The Hungarian algorithm". This polynomial-scaling algorithm is sometimes credited as the predecessor to primal-dual linear programming approaches. Read More ›

More Articles


Every other week, one of us will learn an algorithm, present and upload a brief summay.

More ›


We meet every other Thusday from 1:00-2:00 pm CST in Loomis 322.

More ›


We will archive covered algorithms here, as well as post potentially interesting algorithms to be covered.

More ›