Bibliography

[Teb01] Tebboth, J. R.: A computational study of Dantzig-Wolfe decomposition. PhD thesis, University of Buckingham, 2001. ( http://www.blisworthhouse.co.uk/OR/Decomposition/tebboth.pdf)

[PW94] Pochet, Y. and Wolsey, L. A.: Algorithms and Reformulations for Lot Sizing Problems. Technical reportDiscussion Paper 9427, CORE, Université Catholique de Louvain, 1994.

[Hu69] Hu, T. C.: Integer programming and network flows. Addison-Wesley, Reading, MA, 1969.

[Hei12] Heipcke, S.: Xpress-Mosel: Multi-Solver, Multi-Problem, Multi-Model, Multi-Node Modeling and Problem Solving. In Kallrath, J., ed., Algebraic Modeling Systems: Modeling and Solving Real World Optimization Problems, pages 77–110. Springer, Heidelberg, 2012.

[FT63] Fisher, H. and Muth, J. F.: Probabilistic Learning Combinations of Local Job-Shop Scheduling Rules. In Muth, J. F. and Thompson, G. L., ed., Industrial Scheduling, pages 225–251. Prentice Hall, Englewood Cliffs, N. J., 1963.