Pages that link to "Item:Q6066594"
From MaRDI portal
The following pages link to A note on computational aspects of the Steiner traveling salesman problem (Q6066594):
Displaying 4 items.
- The Steiner traveling salesman problem and its extensions (Q1999396) (← links)
- An asymptotically tight online algorithm for \(m\)-steiner traveling salesman problem (Q2059872) (← links)
- Vehicle routing on road networks: how good is Euclidean approximation? (Q2668618) (← links)
- Improving a constructive heuristic for the general routing problem (Q6179705) (← links)