| SDPLR | A class of nonlinear algorithms for solving some specially structured, large-scale semidefinite programs via a low-rank factorization scheme. |
| Max-AO | High-quality heuristics for the maximum stable set, maximum clique, and related problems |
| CirCut | Extremely fast, scalable, Goemans-Williamson-quality heuristics for the maximum cut problem, maximum bisection problem, and other graph partitioning problems; this link will take you to the web page of my colleague, Yin Zhang of Rice University |
Last edited Thursday, March 14, 2002.
Send mail to
samuel-burer@uiowa.edu.