Sometimes Travelling is Easy: The Master Tour Problem
DOI10.1137/S0895480195281878zbMATH Open0914.90253OpenAlexW2119735681MaRDI QIDQ4388980FDOQ4388980
Authors: Vladimir G. Deineko, Rüdiger Rudolf, Gerhard J. Woeginger 
Publication date: 11 May 1998
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895480195281878
Recommendations
Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Paths and cycles (05C38) Parallel algorithms in computer science (68W10)
Cited In (19)
- Recognising permuted Demidenko matrices
- Approximation algorithms for distance constrained vehicle routing problems
- A New Tractable Case of the QAP with a Robinson Matrix
- New special cases of the quadratic assignment problem with diagonally structured coefficient matrices
- Traveling salesman games with the Monge property
- Sometimes travelling is easy: The master tour problem
- The neighbor-net algorithm
- Algorithms for the universal and a priori TSP
- The trouble with the second quantifier
- Balancing profits and costs on trees
- A priori TSP in the scenario model
- On the Complexity of Master Problems
- The three-dimensional matching problem in kalmanson matrices
- Packing a Knapsack of Unknown Capacity
- The multi-stripe travelling salesman problem
- A priori TSP in the Scenario Model
- A Note On Kalmanson Matrices∗
- On one approach to TSP structural stability
- Four-point conditions for the TSP: the complete complexity classification
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)
