1. K.S. Booth and G.S. Lueker, Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms,Journal of Computer and System Sciences 13 (1976) 335–379.
2. V.Y. Burdyuk and V.N. Trofimov, Generalization of the results of Gilmore and Gomory on the solution of the traveling salesman problem,Izw. Akad. Nauk SSSR, Tech. Kibernet., issue 3 (1976) 16–22 (in Russian); English translation in:Engineering Cybernetics 14 (1976) 12–18.
3. R.E. Burkard, Locations with spatial interactions: The quadratic assignment problem, in: R.L. Francis and P.B. Mirchandani, eds.,Discrete Location Theory (Academic Press, New York, 1989) 387–437.
4. 3 Report;R.E. Burkard,1997
5. SFB Report;R.E. Burkard,1994