[1] R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network flows: theory, algorithms, and applications, Prentice-Hall, Englewood Cliffs, 1993.

[2] E. Balas, Disjunctiv programming, "Annals of Discrete Mathematics", 8, 1975, pp. 146-164.

[3] E. Balas, S. Ceria, and G. Cornuéjols, A lift-and-project cutting plane algorithm for mixed 0-1 programs, "Mathematical programming", 58 , 1993, pp. 295-324.

[4] M.S. Bazaraa, J.J. Jarvis, and H.D. Sherali, Linear programming and network flows, 2nd ed., John Wiley & Sons, New York, 1990.

[5] R. Bellman, Dynamic Programming, Princeton University Press, Princeton, 1958.

[6] J.A. Bondy and U.S.R. Murty, Graph theory with applications, North Holland New York, 1976.

[7] W.J. Cook, W.H. Cunningham, W.R. Pulleyblank, and A. Schrijver, Combinatorial optimization, John Wiley & Sons, New York, 1998.

[8] G.B. Dantzig, Decomposition principles for linear programs, "Operations Research", 8, 1960, pp. 101-111.

[9] G.B. Dantzig, Linear programming and extensions, Princeton University Press, Princeton, 1963.

[10] J. Edmonds, Maximum matching and a polyhedron with 0,1-vertices, "Journal of Research of the National Bureau of Standards", 69B , 1965, pp. 125-130.

[11] L.R. Ford and D.R. Fulkerson, Flows in networks, Princeton University Press, Princeton, 1962.

[12] A.M. Geoffrion, Lagrangean relaxation for integer programming, "Mathematical Programming Study", 2 , 1974, pp. 82-114.

[13] P.E. Gilmore and R.E. Gomory, A linear programming approach to the cutting stock problem-II , "Operations Research", 11, 1963.

[14] F. Glover, D. Klingman, and N.V. Phillips, Network models in optimization and their applications in practice, John Wiley & Sons, New York, 1992.

[15] R.E. Gomory, Outline of an algorithm for integer solutions to linear programs, "Bulletin of the American Mathematical Society", 64, 1958 , pp. 275-278.

[16] R.E. Gomory, Solving linear programming problems in integers, in "Combinatorial Analysis", R.E. Bellman and M. Hall (eds.), American Mathematical Society, 1960, pp. 211-216.

[17] M. Grötschel and O. Holland, Solving matching problems with linear programming, "Mathematical Programming", 33, 1983, pp. 243-259.

[18] M. Grötschel and L. Lovász, Combinatorial optimization, in "Handbook in Combinatorics", vol. 2, R.L. Graham, M. Grötschel, and L. Lovász (eds.), Elsevier, 1995, pp. 1541-1597.

[19] M. Grötschel, L. Lovász, and A. Schrijver, Geometric algorithms and combinatorial optimization, Springer-Verlag, Berlin, 1988.

[20] M. Grötschel and M.W. Padberg, Polyhedral theory, in "The traveling salesman problem", E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys (eds.), John Wiley & Sons, New York, 1985.

[21] M. Held and R.M. Karp, The traveling salesman problem and minimum spanning trees, "Operations Research", 18 , 1970, pp. 1138-1162.

[22] M. Held and R.M. Karp, The traveling salesman problem and minimal spanning trees: part II, "Mathematical Programming", 1 , 1971, pp. 6-25.

[23] M. Jünger, G. Reinelt, and G. Rinaldi, The traveling salesman problem, in "Handbook in operations research and management science", vol. 7, Network models, M.O. Ball, T.L. Magnanti, C.L. Monma, and G.L. Nemhauser (eds.), Elsevier, 1995.

[24] G.L. Nemhauser and L.A. Wolsey, Integer and combinatorial optimization, John Wiley & Sons, New York, 1988.

[25] M.W. Padberg and M.R. Rao, Odd minimum cut-sets and b-matchings, "Mathematics of Operations Research", 7, 1982, pp. 67-80.

[26] M.W. Padberg and G. Rinaldi, Optimization of a 532 city symmetric traveling salesman problem by branch and cut, "Operations Research Letters", 6, 1987, pp. 1-7.

[27] M.W. Padberg and G. Rinaldi, A branch and cut algorithm for the resolution of large-scale symmetric salesman problems, "SIAM Review", 33, 1991, pp. 60-100.

[28] C.H. Papadimitriou and K. Steiglitz, Combinatorial optimization algorithms and complexity, Prentice-Hall, Englewood Cliffs, 1982.

[29] R.T. Rockafellar, Network flows and monotropic optimization, John Wiley & Sons, New York, 1984.

[30] A. Schrijver, Theory of linear and integer programming, John Wiley & Sons, Chichester, 1986.