Pages that link to "Item:Q1285454"

The following pages link to Algorithms for the minimax problem of the traveling salesman. I: An approach based on dynamic programming (Q1285454):

Displaying 4 items.

• The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis (Q336878) (← links)
• Experimental analysis of heuristics for the bottleneck traveling salesman problem (Q519098) (← links)
• Dynamic programming in the generalized bottleneck problem and the start point optimization (Q5224167) (← links)
• On the Application of the Minimax Traveling Salesman Problem in Aviation Logistics (Q6153045) (← links)