On a new polynomial algorithm for solving NPC problems

Intelligent systems generally face optimization problems when solving specific problems, and complex optimization problems are usually non-deterministic polynomial complete (NPC) problems. To solve such problems, approximation methods are generally adopted. This paper presents an accurate method for...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Intelligent data analysis 2019-01, Vol.23 (S1), p.87-111
1. Verfasser:	Liang, Sishuai
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Ant colony optimization Approximation Complexity Computer simulation Evolutionary algorithms Evolutionary computation Genetic algorithms Maximum entropy Neighborhoods Particle swarm optimization Polynomials Random numbers Sampling Simulated annealing Tabu search Traveling salesman problem
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!