Pages that link to "Item:Q1612766"
From MaRDI portal
The following pages link to The traveling salesman problem and its variations (Q1612766):
Displaying 9 items.
- Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem (Q5881498) (← links)
- Vehicle routing problems with multiple trips (Q5915965) (← links)
- The feasible region for consecutive patterns of permutations is a cycle polytope (Q5918948) (← links)
- A note on computational aspects of the Steiner traveling salesman problem (Q6066594) (← links)
- Two-stage dynamic programming in the routing problem with decomposition (Q6078066) (← links)
- On the Application of the Minimax Traveling Salesman Problem in Aviation Logistics (Q6153045) (← links)
- An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading (Q6160334) (← links)
- (Q6160407) (← links)
- Time complexity of the analyst's traveling salesman algorithm (Q6200929) (← links)