1. Land, A.H., Doig, A.G.: An automatic method of solving discrete programming problems. Econometrica 28(3), 497–520 (1960)
2. Brown, C.A., Purdom Jr, P.W.: An empirical comparison of backtracking algorithms. IEEE PAMI 309–315 (1982)
3. Rossi, F., Beek, P.V., Walsh, T.: constraint satisfaction: an emerging paradigm. Handbook of Constraint Programming. Foundations of Artificial Intelligence. Amsterdam: Elsevier, p. 14 (2006). ISBN 978–0–444–52726–4
4. Bellman, R. The Theory of Dynamic Programming. The RAND Corporation (1954)
5. Desaulniers, G., Desrosiers, J., Spoorendonk, S.: Cutting Planes for Branch-and-Price Algorithms. Published online 29 October 2011 in Wiley Online Library (wileyonlinelibrary.com). © 2011 Wiley Periodicals, Inc.