1. Burkard R.E.: Special cases of travelling salesman problems and heuristics. Acta Math. Appl. Sinica6, 273–288 (1990)
2. Burkard, R.E., Klinz, B., Rudolf, R.: Perspectives of Monge properties in optimization, Report 2, SFB “Optimierung und Kontrolle”, University of Technology, Graz, Austria, July 1994. Discrete Appl. Math, (to appear)
3. Deineko, V.G., Filonenko, V.L.: On the reconstruction of specially structured matrices. Aktualnyje Problemy EVM programmirovanije, Dnepropetrovsk, DGU, 1979, (in Russian)
4. Deineko, V.G., Rudolf, R., Woeginger, G.J.: A general approach to avoid forbidden 2 × 2 submatrices. Computing52, 371–388 (1994)
5. Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness. San Francisco: Freeman 1979