1. Applegate, D., Bixby, R., Chvatal, V. and Cook, W., 1998, On the solution of traveling salesman problems, in: Proc. Int. Congress of Mathematicians, Doc. Math. J. DMV, Vol. 645.
2. Barnhart, C., Johnson, E. L., Nemhauser, G. L., Savelsbergh, M. W. P. and Vance, P. H., 1998, Branch-and-price: column generation for huge integer programs, Oper. Res.
46:316.
3. Bixby, R. E., Fenelon, M., Gu, Z., Rothberg, E. and Wunderling, R., 1999, MIP: Theory and Practice—Closing the Gap, Proc. 19th IFIP TC7 Conf. on System Modelling, Kluwer, Dordrecht, pp. 19–50.
4. Common Optimization INterface for Operations Research (COIN), 2004, at http://www.coin-or.org
5. Cordier, C., Marchand, H., Laundy, R. and Wolsey, L. A., 1999, bc-opt: a branch-and-cut code for mixed integer programs, Math. Program.
86:335.