1. A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems;Atamtürk;Journal of Heuristics,1995
2. R.E. Bixby, S. Ceria, C.M. McZeal, M.W.P. Savelsbergh, An updated mixed integer programming library: MIPLIB 3.0, Technical Report TR98-03, Department of Computational and Applied Mathematics, Rice University, Houston, TX, 1996. Available from URL http://www.caam.rice.edu/∼bixby/miplib/miplib.html.
3. R. Borndörfer, R. Weismantel, Set packing relaxations of some integer programs, Technical Report SC 97-30, Konrad-Zuse-Zentrum für Informationstechnik Berlin, 1997
4. Logical reduction methods in zero–one programming;Guignard;Operations Research,1981
5. Improving LP-representations of zero–one linear programs for branch-and-cut;Hoffman;ORSA Journal on Computing,1991