Pages that link to "Item:Q3678965"
From MaRDI portal
The following pages link to On the refinement of bounds of heuristic algorithms for the traveling salesman problem (Q3678965):
Displaying 4 items.
- On the relationship of approximation algorithms for the minimum and the maximum traveling salesman problem (Q1078097) (← links)
- Triangle inequality and symmetry in connection with the assignment and the traveling salesman problem (Q1119486) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- Sharp bounds for Karp's “patching”-algorithm for the approximate solution of the traveling salesman problem (Q3730367) (← links)
