The following pages link to (Q4461913):
Displaying 13 items.
- Experimental analysis of heuristics for the bottleneck traveling salesman problem (Q519098) (← links)
- Pyramidal tours and multiple objectives (Q604948) (← links)
- Three value TSP and linkages with the three value linear spanning 2-forests (Q765337) (← links)
- A new asymmetric pyramidally solvable class of the traveling salesman problem (Q867920) (← links)
- The pyramidal capacitated vehicle routing problem (Q2270294) (← links)
- Four-point conditions for the TSP: the complete complexity classification (Q2339841) (← links)
- Multiobjective traveling salesperson problem on Halin graphs (Q2378458) (← links)
- On the Euclidean TSP with a permuted van der Veen matrix (Q2390323) (← links)
- A review of TSP based approaches for flowshop scheduling (Q2572854) (← links)
- Robotic-cell scheduling: special polynomially solvable cases of the traveling salesman problem on permuted Monge matrices (Q2576775) (← links)
- New exponential neighbourhood for polynomially solvable TSPs (Q3439139) (← links)
- The Number of Flips Required to Obtain Non-crossing Convex Cycles (Q5302750) (← links)
- Travelling salesman paths on Demidenko matrices (Q6558670) (← links)
