Pages that link to "Item:Q787877"

The following pages link to Transforming asymmetric into symmetric traveling salesman problems (Q787877):

Displaying 18 items.

• The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis (Q336878) (← links)
• An ILP-refined tabu search for the directed profitable rural postman problem (Q406489) (← links)
• A data-guided lexisearch algorithm for the asymmetric traveling salesman problem (Q410535) (← links)
• Improved filtering for weighted circuit constraints (Q487627) (← links)
• Solving the asymmetric traveling purchaser problem (Q867540) (← links)
• Transforming asymmetric into symmetric traveling salesman problems: Erratum (Q1084026) (← links)
• Triangle inequality and symmetry in connection with the assignment and the traveling salesman problem (Q1119486) (← links)
• On the generalized 2-peripatetic salesman problem (Q1328613) (← links)
• An effective implementation of the Lin-Kernighan traveling salesman heuristic (Q1584821) (← links)
• Efficient filtering for the resource-cost alldifferent constraint (Q1701236) (← links)
• The effect of the asymmetry of road transportation networks on the traveling salesman problem (Q1762144) (← links)
• From symmetry to asymmetry: generalizing TSP approximations by parametrization (Q2140484) (← links)
• Generalization of machine learning for problem reduction: a case study on travelling salesman problems (Q2241908) (← links)
• Crowdshipping by employees of distribution centers: optimization approaches for matching supply and demand (Q2242299) (← links)
• Cut-and-solve: An iterative search strategy for combinatorial optimization problems (Q2457618) (← links)
• Solution of real-world postman problems (Q2482818) (← links)
• Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics (Q2636833) (← links)
• From symmetry to asymmetry: generalizing TSP approximations by parametrization (Q6098151) (← links)