scientific article
From MaRDI portal
Publication:3932608
zbMath0476.90081MaRDI QIDQ3932608
Publication date: 1980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
traveling salesmansymmetric groupNP-completenesspolynomial algorithmcyclic permutationsHamiltonian cubic graph
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35)
Related Items
Efficiently solvable special cases of hard combinatorial optimization problems, Two-machine stochastic flow shops with blocking and the traveling salesman problem, On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices, Efficient filtering for the resource-cost alldifferent constraint, Efficiently solvable special cases of bottleneck travelling salesman problems, Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood, Robotic-cell scheduling: special polynomially solvable cases of the traveling salesman problem on permuted Monge matrices, Small and large TSP: Two polynomially solvable cases of the traveling salesman problem, An \(O(n)\) algorithm to solve the Bottleneck Traveling Salesman Problem restricted to ordered product matrices
