1. T. Achterberg, T. Koch, A. Martin, The mixed integer programming library: MIPLIB 2003, 2003. http://miplib.zib.de.
2. D. Applegate, R.E. Bixby, V. Chvátal, W. Cook, Finding cuts in the TSP, Technical Report 95-05, DIMACS, March 1995.
3. Experiments in mixed-integer programming;Benichou;Math. Programming,1971
4. Decomposing matrices into blocks;Borndörfer;SIAM J. Optim,1998
5. J.M. Clochard, D. Naddef, Using path inequalities in a branch-and-cut code for the symmetric traveling salesman problem, in: L.A. Wolsey, G. Rinaldi (Eds.), Proceedings on the Third IPCO Conference, 1993, pp. 291–311.