Sometimes Travelling is Easy: The Master Tour Problem
From MaRDI portal
Publication:4388980
Recommendations
Cited in
(19)- A priori TSP in the scenario model
- Packing a knapsack of unknown capacity
- The neighbor-net algorithm
- Balancing profits and costs on trees
- Algorithms for the universal and a priori TSP
- The trouble with the second quantifier
- Recognising permuted Demidenko matrices
- The multi-stripe travelling salesman problem
- Traveling salesman games with the Monge property
- On one approach to TSP structural stability
- On the complexity of master problems
- Four-point conditions for the TSP: the complete complexity classification
- The three-dimensional matching problem in kalmanson matrices
- Sometimes travelling is easy: The master tour problem
- A new tractable case of the QAP with a Robinson matrix
- A priori TSP in the Scenario Model
- Approximation algorithms for distance constrained vehicle routing problems
- A Note On Kalmanson Matrices∗
- New special cases of the quadratic assignment problem with diagonally structured coefficient matrices
This page was built for publication: Sometimes Travelling is Easy: The Master Tour Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4388980)