1. Capacitated facility location: separation algorithms and computational experience;Aardal;Math. Programming,1998
2. Capacitated facility location: valid inequalities and facets;Aardal;Math. Oper. Res.,1995
3. D. Applegate, R.E. Bixby, V. Chvátal, W. Cook, Project-and-lift (a paradigm for finding cuts), Draft, Aussois, March, 1998.
4. A. Atamturk, On network design cut-set polyhedra, Draft, Department of Industrial Engineering and Operations Research, U.C. at Berkeley, August, 1999.
5. A. Atamturk, G.L. Nemhauser, M.W.P. Savelsbergh, Conflict graphs in integer programming, Technical Report LEC 98-03, Georgia Institute of Technology, 1998.