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 10 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)
• Discrete optimization by optimal control methods. III. The dynamic traveling salesman problem (Q885705) (← links)
• The traveling salesman problem. II: Exact methods (Q918427) (← links)
• Algorithms for the minimax problem of the travelling salesman. II: Dual approach (Q1285427) (← links)
• Computational algorithms for the solution of the salesman problem. I: General pattern of classification (Q1914360) (← 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)
• A bottleneck routing problem with a system of priority tasks (Q6169144) (← links)
• The routing bottlenecks problem (optimization within zones) (Q6571121) (← links)