Minimizing Wallpaper Waste, Part 1: A Class of Traveling Salesman Problems
From MaRDI portal
Cited in
(21)- Hamiltonian properties of Toeplitz graphs
- Efficiently solvable special cases of bottleneck travelling salesman problems
- The traveling salesman problem: An overview of exact and approximate algorithms
- Hamiltonian cycles in circulant digraphs with two stripes
- New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization
- On the powers of matrices in bottleneck/fuzzy algebra
- The robustness of interval fuzzy matrices
- Generalisations of the Gilmore-Gomory traveling salesman problem and the Gilmore-Gomory scheme: a survey
- Hamiltonian Cycles in Striped Graphs: The Two-Stripe Problem
- Well-solved cases of the 2-peripatetic salesman problem
- On Eigenproblem for Circulant Matrices in Max-Algebra
- Characterizing the integrality gap of the subtour LP for the circulant traveling salesman problem
- On Hamiltonian paths in distance graphs
- Characterizing bipartite Toeplitz graphs
- A comparison of lower bounds for the symmetric circulant traveling salesman problem
- The two-stripe symmetric circulant TSP is in P
- Circulant TSP: vertices of the edge-length polytope and superpolynomial lower bounds
- On queens and tours
- Circulant TSP special cases: easily-solvable cases and improved approximations
- Long cycles and paths in distance graphs
- The optimum execution order of queries in linear storage
This page was built for publication: Minimizing Wallpaper Waste, Part 1: A Class of Traveling Salesman Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4168391)
