1. Ascheuer, N.: Hamiltonian path problems in the on-line optimization of flexible manufacturing systems. PhD Thesis, Technische Universität Berlin, Berlin (1995)
2. Ascheuer, N., Fischetti, M., Grötschel, M.: A polyhedral study of the asymmetric travelling salesman problem with time windows. Networks 36, 69–79 (2000)
3. Balas, E., Ceria, S., Cornuéjols, G.: A lift-and-project cutting plane algorithm for mixed 0-1 programs. Math. Program. 58, 295–324 (1993)
4. Balas, E., Saxena, A.: Optimizing over the Split Closure: Modeling and Theoretical Analysis, IMA “Hot Topics” Workshop: Mixed Integer Programming, Minneapolis, 25–29 July 2005
5. Bixby, R.E., Ceria, S., McZeal, C.M., Savelsbergh, M.W.P.: MIPLIB 3.0, http://www.caam. rice.edu/~bixby/miplib/miplib.html