1. Aardal, K., & Larsson, T. (1990). A Benders decomposition based heuristic for the hierarchical production planning problem. European Journal of Operational Research, 45, 4–14.
2. Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows: Theory, algorithms, and applications. Upper Saddle River, NJ: Prentice-Hall.
3. Amor, H. B., & Valério de Carvalho, J. M. (2005). Cutting stock problems. In G. Desaulnier, J. Desrosiers, & M. M. Solomon (Eds.), Column generation (pp. 132–161). New York: Springer.
4. Arora, S., & Barak, B. (2009). Computational complexity: A modern approach. Cambridge: Cambridge University Press.
5. Balas, E. (1975). Facets of the knapsack polytope. Mathematical Programming, 8, 146–164.