Roy Jonker

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Linear assignment procedures European Journal of Operational Research	2002-08-18	Paper
Fictitious upper bounds in an algorithm for the symmetric traveling salesman problem Computers & Operations Research	1990-01-01	Paper
scientific article; zbMATH DE number 4127004 (Why is no real title available?)	1989-01-01	Paper
Technical Note—An Improved Transformation of the Symmetric Multiple Traveling Salesman Problem Operations Research	1988-01-01	Paper
A shortest augmenting path algorithm for dense and sparse linear assignment problems Computing	1987-01-01	Paper
Better assignment lower bounds for the Euclidean traveling salesman problem Optimization	1987-01-01	Paper
On Some Generalizations of the Travelling-Salesman Problem The Journal of the Operational Research Society	1987-01-01	Paper
Transforming asymmetric into symmetric traveling salesman problems: Erratum Operations Research Letters	1986-01-01	Paper
Improving the Hungarian assignment algorithm Operations Research Letters	1986-01-01	Paper
A note on finding a shortest complete cycle in an undirected graph European Journal of Operational Research	1986-01-01	Paper
Improving Christofides' lower bound for the traveling salesman problem Optimization	1985-01-01	Paper
Nonoptimal Edges for the Symmetric Traveling Salesman Problem Operations Research	1984-01-01	Paper
Transforming asymmetric into symmetric traveling salesman problems Operations Research Letters	1983-01-01	Paper
The symmetric traveling salesman problem and edge exchanges in minimal 1- trees European Journal of Operational Research	1983-01-01	Paper
A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation European Journal of Operational Research	1982-01-01	Paper
Identification of non-optimal arcs for the traveling salesman problem Operations Research Letters	1982-01-01	Paper
Technical Note—Rounding Symmetric Traveling Salesman Problems with an Asymmetric Assignment Problem Operations Research	1980-01-01	Paper
Technical Note—Data-Dependent Bounds for Heuristics to Find a Minimum Weight Hamiltonian Circuit Operations Research	1980-01-01	Paper

Research outcomes over time

This page was built for person: Roy Jonker