Pages that link to "Item:Q4388980"

The following pages link to Sometimes Travelling is Easy: The Master Tour Problem (Q4388980):

Displaying 18 items.

• The three-dimensional matching problem in kalmanson matrices (Q358634) (← links)
• The neighbor-net algorithm (Q550258) (← links)
• Algorithms for the universal and a priori TSP (Q924875) (← links)
• The multi-stripe travelling salesman problem (Q1698268) (← links)
• New special cases of the quadratic assignment problem with diagonally structured coefficient matrices (Q1754256) (← links)
• A priori TSP in the scenario model (Q1801079) (← links)
• Traveling salesman games with the Monge property (Q1827808) (← links)
• The trouble with the second quantifier (Q2044549) (← links)
• On one approach to TSP structural stability (Q2248701) (← links)
• Four-point conditions for the TSP: the complete complexity classification (Q2339841) (← links)
• Approximation algorithms for distance constrained vehicle routing problems (Q2892157) (← links)
• On the Complexity of Master Problems (Q2946425) (← links)
• A priori TSP in the Scenario Model (Q2971168) (← links)
• A Note On Kalmanson Matrices^∗ (Q4342970) (← links)
• Packing a Knapsack of Unknown Capacity (Q5275439) (← links)
• Balancing profits and costs on trees (Q5326788) (← links)
• A New Tractable Case of the QAP with a Robinson Matrix (Q5743542) (← links)
• Recognising permuted Demidenko matrices (Q6556164) (← links)