The following pages link to Ton Volgenant (Q759660):
Displaying 16 items.
- The symmetric clustered traveling salesman problem (Q759661) (← links)
- Transforming asymmetric into symmetric traveling salesman problems (Q787877) (← links)
- Transforming asymmetric into symmetric traveling salesman problems: Erratum (Q1084026) (← links)
- Improving the Hungarian assignment algorithm (Q1085073) (← links)
- Edge exchanges in the degree-constrained minimum spanning tree problem (Q1086497) (← links)
- A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation (Q1158108) (← links)
- Identification of non-optimal arcs for the traveling salesman problem (Q1165781) (← links)
- The symmetric traveling salesman problem and edge exchanges in minimal 1- trees (Q1170119) (← links)
- The multi-weighted Steiner tree problem (Q1179753) (← links)
- Fictitious upper bounds in an algorithm for the symmetric traveling salesman problem (Q1824571) (← links)
- On the hierarchical Chinese postman problem with linear ordered classes (Q2569095) (← links)
- Nonoptimal Edges for the Symmetric Traveling Salesman Problem (Q3337972) (← links)
- On Some Generalizations of the Travelling-Salesman Problem (Q3765575) (← links)
- Technical Note—An Improved Transformation of the Symmetric Multiple Traveling Salesman Problem (Q3786302) (← links)
- Technical Note—Data-Dependent Bounds for Heuristics to Find a Minimum Weight Hamiltonian Circuit (Q3896864) (← links)
- (Q4343707) (← links)
