Pages that link to "Item:Q2282284"
From MaRDI portal
The following pages link to Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs (Q2282284):
Displaying 4 items.
- The multiple Steiner TSP with order constraints: complexity and optimization algorithms (Q2156919) (← links)
- Vehicle routing on road networks: how good is Euclidean approximation? (Q2668618) (← links)
- A note on computational aspects of the Steiner traveling salesman problem (Q6066594) (← links)
- Improving a constructive heuristic for the general routing problem (Q6179705) (← links)