1. T. Achterberg, T. Koch, and A. Martin, Branching rules revisited, OR Letters, 33 (2005), pp. 42–54.
2. K. Andersen, G. Cornu´ejols, and Y. Li, Split closure and intersection cuts, Mathematical Programming, 102 (2005), pp. 457–493.
3. K.M. Anstreicher, Semidefinite programming versus the reformulation- linearization technique for nonconvex quadratically constrained quadratic programming, Journal of Global Optimization, 43 (2009), pp. 471–484.
4. D.L. Applegate, R.E. Bixby, V. Chv´atal, andW.J. Cook, The Traveling Sales- man Problem, A Computational Study, Princeton, 2006.
5. E. Balas, Disjunctive programming: Properties of the convex hull of feasible points, Discrete Applied Mathematics, 89 (1998), pp. 3–44.