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
For the sake of curing family cancer, we have developed this paper. This is based on the idea that if P = NP, a terminal illness such as cancer will be cured. This article is done with the help of many people, including: my classmates, mentors, and others who contribute to it. The algorithm also needs more challenging examples to verify. Due to the rigor of the P/NP problem, enough examples are needed to rise to the theorem.
Liang Sishuai
Tsinghua University
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
