Citation: Re. Burkard et al., THE QUADRATIC ASSIGNMENT PROBLEM WITH A MONOTONE ANTI-MONGE AND A SYMMETRICAL TOEPLITZ MATRIX - EASY AND HARD CASES, Mathematical programming, 82(1-2), 1998, pp. 125-158
Citation: Mj. Golin et G. Rote, A DYNAMIC-PROGRAMMING ALGORITHM FOR CONSTRUCTING OPTIMAL PREFIX-FREE CODES WITH UNEQUAL LETTER COSTS, IEEE transactions on information theory, 44(5), 1998, pp. 1770-1781
Citation: G. Rote et Rf. Tichy, QUASI-MONTE-CARLO METHODS AND THE DISPERSION OF POINT SEQUENCES, Mathematical and computer modelling, 23(8-9), 1996, pp. 9-23
Citation: Vg. Deineko et al., THE CONVEX-HULL-AND-LINE TRAVELING SALESMAN PROBLEM - A SOLVABLE CASE, Information processing letters, 51(3), 1994, pp. 141-148