October 04, 2014 article Open access Four-point conditions for the TSP: The complete complexity classification Discrete Optimization DOI: 10.1016/j.disopt.2014.09.003 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 4 stored of 15 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access Travelling salesman paths on Demidenko matrices 2024 Warwick Research Archive Portal (University of Warwick) article Computer Science Complexity and Algorithms in Graphs Open access 1 citations The bipartite travelling salesman problem: A pyramidally solvable case 2024 Operations Research Letters article Computer Science Complexity and Algorithms in Graphs Open access 2 citations Recognising permuted Demidenko matrices 2023 Operations Research Letters article Computer Science Complexity and Algorithms in Graphs Open access 4 citations Travelling salesman paths on Demidenko matrices 2021 Discrete Applied Mathematics article Computer Science Complexity and Algorithms in Graphs Open access 1 citations 4 results References 0