Technical Note - Data-Dependent Bounds for Heuristics to Find a Minimum Weight Hamiltonian Circuit. - Roy Jonker; Rob Kaas; Ton Volgenant (Oper. Res., 1980)

Technical Note - Rounding Symmetric Traveling Salesman Problems with an Asymmetric Assignment Problem. - Roy Jonker; G. De Leve; J. A. Van Der Velde; A. Volgenant (Oper. Res., 1980)

Identification of non-optimal arcs for the travelling salesman problem. - Roy Jonker; Ton Volgenant (Oper. Res. Lett., 1982)

Nonoptimal Edges for the Symmetric Traveling Salesman Problem. - Roy Jonker; Ton Volgenant (Oper. Res., 1984)

A shortest augmenting path algorithm for dense and sparse linear assignment problems. - Roy Jonker; A. Volgenant (Computing, 1987)

Technical Note - An Improved Transformation of the Symmetric Multiple Traveling Salesman Problem. - Roy Jonker; Ton Volgenant (Oper. Res., 1988)

Fictitious upper bounds in an algorithm for the symmetric traveling salesman problem. - Ton Volgenant; Roy Jonker (Comput. Oper. Res., 1990)

Linear assignment procedures. - Roy Jonker; A. Volgenant (Eur. J. Oper. Res., 1999)