The following pages link to Roy Jonker (Q787876):
Displaying 19 items.
- Transforming asymmetric into symmetric traveling salesman problems (Q787877) (← links)
- (Q1069449) (redirect page) (← links)
- A note on finding a shortest complete cycle in an undirected graph (Q1069451) (← links)
- Transforming asymmetric into symmetric traveling salesman problems: Erratum (Q1084026) (← links)
- Improving the Hungarian assignment algorithm (Q1085073) (← links)
- A shortest augmenting path algorithm for dense and sparse linear assignment problems (Q1085784) (← 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)
- Linear assignment procedures (Q1610146) (← links)
- Fictitious upper bounds in an algorithm for the symmetric traveling salesman problem (Q1824571) (← links)
- Nonoptimal Edges for the Symmetric Traveling Salesman Problem (Q3337972) (← links)
- Improving Christofides' lower bound for the traveling salesman problem (Q3698662) (← links)
- On Some Generalizations of the Travelling-Salesman Problem (Q3765575) (← links)
- Better assignment lower bounds for the Euclidean traveling salesman problem (Q3771999) (← links)
- Technical Note—An Improved Transformation of the Symmetric Multiple Traveling Salesman Problem (Q3786302) (← links)
- Technical Note—Rounding Symmetric Traveling Salesman Problems with an Asymmetric Assignment Problem (Q3885528) (← links)
- Technical Note—Data-Dependent Bounds for Heuristics to Find a Minimum Weight Hamiltonian Circuit (Q3896864) (← links)
- (Q4206568) (← links)
