Pages that link to "Item:Q4658394"

The following pages link to An improved branching rule for the symmetric travelling salesman problem (Q4658394):

Displaying 9 items.

• The selective travelling salesman problem (Q910347) (← links)
• Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem (Q1044139) (← links)
• A study of the parameters of branch-and-bound algorithms for solving the symmetric traveling salesman problem (Q1281074) (← links)
• Managing spatio-temporal complexity in Hopfield neural network simulations for large-scale static optimization. (Q1427733) (← links)
• Branch-and-bound algorithm for Symmetric Travelling Salesman problem (Q1671016) (← links)
• Fictitious upper bounds in an algorithm for the symmetric traveling salesman problem (Q1824571) (← links)
• A note on relatives to the Held and Karp 1-tree problem (Q2494821) (← links)
• Technical Note—An Improved Transformation of the Symmetric Multiple Traveling Salesman Problem (Q3786302) (← links)
• Results for the close-enough traveling salesman problem with a branch-and-bound algorithm (Q6097759) (← links)