Primal Dual
Expander flows, geometric embeddings, and graph partitioning Sanjeev Arora Princeton Satish Rao UC Berkeley Umesh Vazirani UC Berkeley ( + survey of other.
Geometric Embeddings, Graph Partitioning, and Expander flows: A survey of recent results Sanjeev Arora Princeton ( touches upon: S. A., Satish Rao, Umesh.
Norwegian University of Science and Technology MILP algorithms: branch-and-bound and branch-and-cut.
The M-Best Mode Problem
