1. Aardal, K., van Hoesel, S.: Polyhedral techniques in combinatorial optimization. Statistica Neerlandica 50, 3–26 (1996)
2. Ahuja, R., Magnanti, T., Orlin, J.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs, NJ, 1993
3. Applegate, D., Bixby, R., Chvátal, V., Cook, W.: TSP cuts which do not conform to the template paradigm. In: Computational Combinatorial Optimization, Springer, 2001 pp. 261–303
4. Augerat, P., Belenguer, J.M., Benavent, E., Corberán, A., Naddef, D., Rinaldi, G.: Computational Results with a Branch and Cut Code for the Capacitated Vehicle Routing Problem. Technical Report 949-M, Université Joseph Fourier, Grenoble, France, 1995
5. Balas, E., Christofides, N.: A restricted Lagrangean approach to the traveling salesman problem. Mathematical Programming 21, 19–46 (1981)