Ton Volgenant

From MaRDI portal
(Redirected from Person:759660)



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!

PublicationDate of PublicationType
On the hierarchical Chinese postman problem with linear ordered classes
European Journal of Operational Research
2005-10-17Paper
scientific article; zbMATH DE number 1031384 (Why is no real title available?)
 
1997-07-06Paper
The multi-weighted Steiner tree problem
Annals of Operations Research
1992-06-27Paper
Fictitious upper bounds in an algorithm for the symmetric traveling salesman problem
Computers & Operations Research
1990-01-01Paper
Technical Note—An Improved Transformation of the Symmetric Multiple Traveling Salesman Problem
Operations Research
1988-01-01Paper
On Some Generalizations of the Travelling-Salesman Problem
The Journal of the Operational Research Society
1987-01-01Paper
Transforming asymmetric into symmetric traveling salesman problems: Erratum
Operations Research Letters
1986-01-01Paper
Improving the Hungarian assignment algorithm
Operations Research Letters
1986-01-01Paper
The symmetric clustered traveling salesman problem
European Journal of Operational Research
1985-01-01Paper
Edge exchanges in the degree-constrained minimum spanning tree problem
Computers & Operations Research
1985-01-01Paper
Nonoptimal Edges for the Symmetric Traveling Salesman Problem
Operations Research
1984-01-01Paper
Transforming asymmetric into symmetric traveling salesman problems
Operations Research Letters
1983-01-01Paper
The symmetric traveling salesman problem and edge exchanges in minimal 1- trees
European Journal of Operational Research
1983-01-01Paper
A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
European Journal of Operational Research
1982-01-01Paper
Identification of non-optimal arcs for the traveling salesman problem
Operations Research Letters
1982-01-01Paper
Technical Note—Data-Dependent Bounds for Heuristics to Find a Minimum Weight Hamiltonian Circuit
Operations Research
1980-01-01Paper


Research outcomes over time


This page was built for person: Ton Volgenant