Heuristics for biquadratic assignment problems and their computational comparison, (mit R. E. Burkard),
European Journal of Operational Research 83, 1995, 283--300.
A minimax assignment problem in treelike communication
networks,
(mit R. E. Burkard und G. J. Woeginger),
European Journal of Operational Research 87, 1995, 670--684.
The quadratic assignment problem with an Anti-Monge and a Toeplitz matrix: easy and hard cases,
(mit R. E. Burkard, G. J. Woeginger und G. Rote),
Mathematical Programming 82, 1998, 125-158.
A communication assignment problem on trees: heuristics and
asymptotic behaviour,
(mit R. E. Burkard und T. Dudas),
Lecture Notes in Economics and Mathematical Systems 450, 1996, 127--156, Springer-Verlag.
Hamiltonian cycles in circulant digraphs with two stripes,
(mit R. E. Burkard, G. J. Woeginger und Q. F. Yang),
Discrete Mathematics 176, 1997, 233--254.
Quadratic and three-dimensional assignments: an annotated
bibliography,
(mit R. E. Burkard),
in "Annotated Bibliographies in Combinatorial Optimization",
Hrsg.: M. Dell'Amico, F. Maffioli and S.Martello, Wiley, Chichester, 1997, pp. 373--392.
A unified approach to simple special cases of extremal permutation
problems,
(mit R. E. Burkard, V. M. Demidenko, N. N.Metelski und G. J. Woeginger),
Optimization 44, 1998, 123--138.
A dual framework for lower bounds of the quadratic assignment
problem based on linearization,
(mit S. E. Karisch, J. Clausen, und T. Espersen),
Computing 63, 1999, 351--403.
2-Medians in trees with pos/neg weights,
(mit R. E. Burkard, H. Dollani),
Discrete Applied Mathematics 105, 2000, 51-71.
The Quadratic assignment problem,
(mit R. E. Burkard, P. M. Pardalos, and L. S. Pitsoulis),
in "Handbook of Combinatorial Optimization",
P. M. Pardalos and D.-Z. Du, eds., Kluwer Academic Publishers, 1998, pp. 241--338.
