A new polynomial-time algorithm for linear programming was announced by Narendra Karmarkar of Bell Laboratories in 1984. This algorithm is claimed by Bell Labs significantly to outperform the simplex ...

While sitting in a courtroom, waiting to find out if he would be chosen for jury duty, Daniel Spielman had a revelation-all the work he and colleague Shanghua Teng had built up over the past three ...

PROC NETFLOW solves network problems that can have side constraints. Certain algebraic features of networks are exploited by a specialized version of the Simplex method so that solution times are ...