We could add functionality to optionally retrieve the DP matrix for edit-like distances. This would conflict with my desire to lower memory usage by not storing the full DP-matrix for computation.

We analyze two popular semidefinite programming relaxations for quadratically constrained quadratic programs with matrix variables. These relaxations are based on vector lifting and on matrix lifting; ...

The paper shows how the technique of dynamic programming was applied to the problem of determining the optimum mix of widths of steel used to `pack' a transformer coil. The approach enables the ...