Roy Jonker

Available identifiers

List of research outcomes

Publication	Date of Publication	Type
Linear assignment procedures	2002-08-18	Paper
Fictitious upper bounds in an algorithm for the symmetric traveling salesman problem	1990-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4206568	1989-01-01	Paper
Technical Note—An Improved Transformation of the Symmetric Multiple Traveling Salesman Problem	1988-01-01	Paper
A shortest augmenting path algorithm for dense and sparse linear assignment problems	1987-01-01	Paper
Better assignment lower bounds for the Euclidean traveling salesman problem	1987-01-01	Paper
On Some Generalizations of the Travelling-Salesman Problem	1987-01-01	Paper
Transforming asymmetric into symmetric traveling salesman problems: Erratum	1986-01-01	Paper
Improving the Hungarian assignment algorithm	1986-01-01	Paper
A note on finding a shortest complete cycle in an undirected graph	1986-01-01	Paper
Improving Christofides' lower bound for the traveling salesman problem	1985-01-01	Paper
Nonoptimal Edges for the Symmetric Traveling Salesman Problem	1984-01-01	Paper
Transforming asymmetric into symmetric traveling salesman problems	1983-01-01	Paper
The symmetric traveling salesman problem and edge exchanges in minimal 1- trees	1983-01-01	Paper
A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation	1982-01-01	Paper
Identification of non-optimal arcs for the traveling salesman problem	1982-01-01	Paper
Technical Note—Rounding Symmetric Traveling Salesman Problems with an Asymmetric Assignment Problem	1980-01-01	Paper
Technical Note—Data-Dependent Bounds for Heuristics to Find a Minimum Weight Hamiltonian Circuit	1980-01-01	Paper

Research outcomes over time

This page was built for person: Roy Jonker