The following pages link to (Q4145160):
Displaying 12 items.
- A successful algorithm for solving directed Hamiltonian path problems (Q788642) (← links)
- Minimum deviation and balanced optimization: A unified approach (Q806674) (← links)
- Solution of large-scale symmetric travelling salesman problems (Q810369) (← links)
- Lower bounds for the symmetric travelling salesman problem from Lagrangean relaxations (Q908860) (← links)
- Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem (Q1044139) (← links)
- A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation (Q1158108) (← links)
- The symmetric traveling salesman problem and edge exchanges in minimal 1- trees (Q1170119) (← links)
- The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761) (← links)
- A branch and bound algorithm for symmetric 2-peripatetic salesman problems (Q1310005) (← links)
- New lower bounds for the symmetric travelling salesman problem (Q1824572) (← links)
- The traveling salesman problem with backhauls (Q1915968) (← links)
- A note on relatives to the Held and Karp 1-tree problem (Q2494821) (← links)
