Pages that link to "Item:Q4162995"

The following pages link to Some Examples of Difficult Traveling Salesman Problems (Q4162995):

Displaying 26 items.

• On the number of iterations of local improvement algorithms (Q594546) (← links)
• On the relationship of approximation algorithms for the minimum and the maximum traveling salesman problem (Q1078097) (← links)
• The fleet size and mix vehicle routing problem (Q1085780) (← links)
• How easy is local search? (Q1109573) (← links)
• A polynomial-time solution to Papadimitriou and Steiglitz's ``traps'' (Q1109689) (← links)
• Triangle inequality and symmetry in connection with the assignment and the traveling salesman problem (Q1119486) (← links)
• A probabilistic analysis of the switching algorithm for the Euclidean TSP (Q1122505) (← links)
• On minimal Eulerian graphs (Q1162523) (← links)
• Optimization, approximation, and complexity classes (Q1186548) (← links)
• A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems (Q1194853) (← links)
• Optimal arcs for the traveling salesman problem (Q1195644) (← links)
• Traveling salesman problem and local search (Q1195657) (← links)
• Local search and the local structure of NP-complete problems (Q1200797) (← links)
• An empirical study of a new metaheuristic for the traveling salesman problem (Q1291637) (← links)
• An effective implementation of the Lin-Kernighan traveling salesman heuristic (Q1584821) (← links)
• Measuring instance difficulty for combinatorial optimization problems (Q1762054) (← links)
• Data-independent neighborhood functions and strict local optima (Q1763477) (← links)
• k-interchange procedures for local search in a precedence-constrained routing problem (Q1836590) (← links)
• Polynomial transformations and data-independent neighborhood functions (Q1887061) (← links)
• HAMILTONian circuits in chordal bipartite graphs (Q1923528) (← links)
• Knowing All Optimal Solutions Does Not Help for TSP Reoptimization (Q3009332) (← links)
• On the refinement of bounds of heuristic algorithms for the traveling salesman problem (Q3678965) (← links)
• Hill Climbing with Multiple Local Optima (Q3690218) (← links)
• Scheduling Large-Scale Advance-Request Dial-A-Ride Systems (Q3771951) (← links)
• Change ringing and Hamiltonian cycles: The search for Erin and Stedman triples (Q5009933) (← links)
• On the Hardness of Reoptimization (Q5448637) (← links)