Max-AO is an ANSI C package for heuristically solving the (unweighted) maximum stable set and maximum clique problems from graph theory. The details of the algorithm behind Max-AO can be found in the paper "Maximum Stable Set Formulations and Heuristics Based on Continuous Optimization" written by Samuel Burer, Renato D.C. Monteiro, and Yin Zhang. The current version of Max-AO is version 0.120301; click to download Download the paper in PDF format Email Samuel Burer with questions or comments