Four-point conditions for the TSP: the complete complexity classification
From MaRDI portal
Publication:2339841
Recommendations
Cites work
- scientific article; zbMATH DE number 3898613 (Why is no real title available?)
- scientific article; zbMATH DE number 4027206 (Why is no real title available?)
- scientific article; zbMATH DE number 3571852 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2064409 (Why is no real title available?)
- scientific article; zbMATH DE number 2064414 (Why is no real title available?)
- scientific article; zbMATH DE number 4189491 (Why is no real title available?)
- A New Class of Pyramidally Solvable Symmetric Traveling Salesman Problems
- A solvable case of the quadratic assignment problem
- A solvable case of the traveling salesman problem
- A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem.
- A survey of very large-scale neighborhood search techniques
- An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem
- Another well-solvable case of the QAP: maximizing the job completion time variance
- Balancing profits and costs on trees
- Cooperative assignment games with the inverse Monge property
- Edgeconvex Circuits and the Traveling Salesman Problem
- Extended neighborhood: Definition and characterization
- Extreme Hamiltonian Circuits. Resolution of the Convex-Even Case
- Extreme Hamiltonian Circuits. Resolution of the Convex-Odd Case
- Extreme Hamiltonian lines
- Fast distance multiplication of unit-Monge matrices
- Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with Monge costs
- Four point conditions and exponential neighborhoods for symmetric TSP
- Hamilton Paths in Grid Graphs
- Linear time dynamic-programming algorithms for new classes of restricted TSPs: a computational study
- Monge properties, discrete convexity and applications
- New exponential neighbourhood for polynomially solvable TSPs
- On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices
- On the recognition of permuted Supnick and incomplete Monge matrices
- On the symmetric traveling salesman problem
- On-line sorting of twisted sequences in linear time
- One-Sided Monge TSP Is NP-Hard
- Perspectives of Monge properties in optimization
- Sometimes Travelling is Easy: The Master Tour Problem
- Sparse Monge matrices arising from scheduling problems
- The Steiner tree problem in Kalmanson matrices and in circulant matrices
- The maximum traveling salesman problem on van der Veen matrices
- The maximum travelling salesman problem on symmetric Demidenko matrices
- The quadratic assignment problem. Theory and algorithms
- The three-dimensional matching problem in kalmanson matrices
- The traveling salesman problem and its variations
- Very large-scale neighborhood search for the quadratic assignment problem
- Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
Cited in
(8)- Recognising permuted Demidenko matrices
- One-Sided Monge TSP Is NP-Hard
- Two simple but efficient algorithms to recognize Robinson dissimilarities
- The multi-stripe travelling salesman problem
- Travelling salesman paths on Demidenko matrices
- On the skeleton of the polytope of pyramidal tours
- Polynomially solvable cases of the bipartite traveling salesman problem
- Polynomial time approximation scheme for single-depot Euclidean capacitated vehicle routing problem
This page was built for publication: Four-point conditions for the TSP: the complete complexity classification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2339841)
