A useful transform of standard input data for a classical NP-complete problem

DOI10.1016/0377-2217(85)90135-3zbMath0564.90085OpenAlexW2030982882MaRDI QIDQ1058470

Francesco A. Brunacci

Publication date: 1985

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(85)90135-3

zbMATH Keywords

equivalent transformationcomputational testssymmetric travelling salesman'diffusive' heuristic procedures

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10)

Related Items (2)

DB2 and DB2A: Two useful tools for constructing Hamiltonian circuits ⋮ Heuristic methods and applications: A categorized survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic analysis of solving the assignment problem for the traveling salesman problem
• A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
• Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
• Approximate Traveling Salesman Algorithms
• Local Search for the Asymmetric Traveling Salesman Problem
• A Fast Algorithm for the Euclidean Traveling Salesman Problem, Optimal with Probability One
• The NP-completeness column: An ongoing guide

This page was built for publication: A useful transform of standard input data for a classical NP-complete problem