1. Applegate DL, Bixby RE, Chvatal V, Cook WJ (2011) The traveling salesman problem: a computational study. Princeton University Press
2. Barnhart C, Johnson EL, Nemhauser GL, Savelsbergh MWP, Vance PH (1998) Branch-and-price: column generation for huge integer programs. Oper Res 46:316
3. Bixby RE, Fenelon M, Gu Z, Rothberg E, Wunderling R (1999) MIP: theory and practice—closing the gap. In: Proceedings of the 19th IFIP TC7 conference on system modelling, Cambridge. Kluwer, Dordrecht, pp 19–50
4. Common Optimization INterface for Operations Research (COIN-OR) (2004)
http://www.coin-or.org
5. Cordier C, Marchand H, Laundy R, Wolsey LA (1999) bc-opt: a branch-and-cut code for mixed integer programs. Math Program 86:335