Pages that link to "Item:Q1184464"
From MaRDI portal
The following pages link to Travelling salesman problem tools for microcomputers (Q1184464):
Displaying 10 items.
- An efficient procedure for obtaining feasible solutions to the n-city traveling salesman problem (Q583125) (← links)
- Certification of an optimal TSP tour through 85,900 cities (Q1002076) (← links)
- Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation (Q1118536) (← links)
- TRAVEL - An interactive travelling salesman problem package for the IBM- personal computer (Q1821039) (← links)
- Computational algorithms for the solution of the salesman problem. I: General pattern of classification (Q1914360) (← links)
- (Q3211117) (← links)
- Travelling salesman problem solved with simulation techniques (Q3801369) (← links)
- Two truck travelling salesman simulation (Q4204019) (← links)
- Solution of a traveling salesman problem in computer component design (Q5184671) (← links)
- The Traveling-Salesman Problem (Q5378674) (← links)