What is it about?
Common optimization algorithms usually use intelligent optimization algorithms and their combinations, but often do not find the optimal solution. Our algorithm adds a vertical search—a hierarchical search method based on the ordinal optimization model, and alternates with the original algorithm, and finally finds the optimal solution and verifies it on the TSP.
Featured Image
Photo by timJ on Unsplash
Why is it important?
We propose a new algorithm and verify P = NP. The algorithm creatively combines the ordinal optimization and the intelligent optimization algorithm based on the matrix idea, which makes up for the shortcomings of the previous algorithm's limited exploration space.
Perspectives
Read the Original
This page is a summary of: On a new polynomial algorithm for solving NPC problems, Intelligent Data Analysis, June 2019, IOS Press,
DOI: 10.3233/ida-192721.
You can read the full text:
Contributors
The following have contributed to this page