1. Implementing the Dantzig–Fulkerson–Johnson algorithm for large traveling salesman problems;Applegate;Math. Prog.,2003
2. D. Applegate, S. Dash, W. Cook, QSopt, Available at 〈www.isye.gatech.edu/∼wcook/qsopt〉.
3. D. Applegate, S. Dash, W. Cook, D. G. Espinoza, QSopt_ex, Available at 〈www.dii.uchile.cl/∼daespino〉.
4. K-cuts: a variation of Gomory mixed integer cuts from the lp tableau;Cornuéjols;INFORMS J. Comput.,2003
5. M. Dhiflaoui, S. Funke, C. Kwappik, K. Mehlhorn, M. Seel, E. Schömer, R. Schulte, D. Weber, Certifying and repairing solutions to large LP's how good are LP-solvers? In: SODA 2003, Proceedings of the 14th Annual ACM–SIAM Symposium on Discrete Algorithms, 2003, pp. 255–256.