Pseudogeometric version of the traveling salesman problem, its application in quantum physics models and some heuristic algorithms for its solution

DOI10.1007/978-3-031-52965-8_32zbMath1547.90169MaRDI QIDQ6616759

Dmitrii Chaikovskii, B. F. Mel'nikov

Publication date: 9 October 2024

geometric approach traveling salesman problem heuristic algorithms mathematical model Hamilton cycles pseudo-geometric version

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Theory of programming languages (68N15) Numerical differentiation (65D25)

This page was built for publication: Pseudogeometric version of the traveling salesman problem, its application in quantum physics models and some heuristic algorithms for its solution