Data Structures and Algorithms

2404 Submissions

[2] viXra:2404.0121 [pdf] submitted on 2024-04-25 20:45:49

Exploring Solution Approaches for the Traveling Salesman Problem: From Heuristic Methods to Exact Algorithms

Authors: Shreyansh Vyas
Comments: 10 Pages. In Russian (Correction made by viXra Admin - Please cite and list scientific references)

This paper presents a comprehensive review of existing TSP (Travelling Salesman Problem) algorithms, followed by the introduction of a novel algorithm designed to efficiently provide optimal solutions within polynomial time. The proposed algorithm not only yields a lower bound on the TSP weight but also guarantees optimality under specific conditions. Through rigorous analysis and experimentation, this research contributes to advancing the field of TSP optimization by offering a reliable and scalable solution.
Category: Data Structures and Algorithms

[1] viXra:2404.0074 [pdf] replaced on 2025-05-04 02:00:49

Integer Optimization and P vs NP Problem

Authors: Yuly Shipilevsky
Comments: 7 Pages.

We give a polynomial-time solution for the "modulo NP-complete problem" on the base of integer optimization algorithms.
Category: Data Structures and Algorithms