scientific article; zbMATH DE number 34438
From MaRDI portal
Publication:3989345
Recommendations
- scientific article; zbMATH DE number 4027206
- Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
- Special cases of the traveling salesman problem
- New exponential neighbourhood for polynomially solvable TSPs
- Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood
Cited in
(34)- Efficiently solvable special cases of bottleneck travelling salesman problems
- Optimal arcs for the traveling salesman problem
- New classes of efficiently solvable generalized traveling salesman problems
- Gilmore-Gomory type traveling salesman problems
- Small and large TSP: Two polynomially solvable cases of the traveling salesman problem
- Special cases of the traveling salesman problem
- Efficiently solvable special cases of hard combinatorial optimization problems
- New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization
- Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood
- The \(x\)-and-\(y\)-axes travelling salesman problem
- Four-point conditions for the TSP: the complete complexity classification
- A polynomial algorithm for a constrained traveling salesman problem
- scientific article; zbMATH DE number 5819786 (Why is no real title available?)
- Universal conditions for algebraic travelling salesman problems to be efficiently solvable
- New exponential neighbourhood for polynomially solvable TSPs
- scientific article; zbMATH DE number 4027206 (Why is no real title available?)
- The traveling salesman problem in graphs with 3-edge cutsets
- scientific article; zbMATH DE number 4045507 (Why is no real title available?)
- scientific article; zbMATH DE number 4053381 (Why is no real title available?)
- scientific article; zbMATH DE number 4083394 (Why is no real title available?)
- scientific article; zbMATH DE number 16721 (Why is no real title available?)
- Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
- Dynamic programming and the graphical traveling salesman problem
- Three easy special cases of the euclidean travelling salesman problem
- Sometimes Travelling is Easy: The Master Tour Problem
- The Kth TSP is pseudopolynomial when TSP is polynomial
- A method for modeling the structure of initial data and subclasses of solvable combinatorial optimization problems
- Provably good solutions for the traveling salesman problem
- Applications of a special polynomial class of TSP
- Applications of a special polynomial class of TSP
- scientific article; zbMATH DE number 4189491 (Why is no real title available?)
- Sometimes travelling is easy: The master tour problem
- Travelling salesman paths on Demidenko matrices
- Classifying traveling salesman problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3989345)
