In EDS ansehen

A class of special combinatorial optimization problems and their algorithms

Gespeichert in:

Bibliographische Detailangaben
Titel:	A class of special combinatorial optimization problems and their algorithms
Autoren:	Luo, Zongjun
Verlagsinformationen:	Editorial Board of Mathematica Applicata, Huazhong University of Science and Technology, Wuhan
Schlagwörter:	Combinatorial optimization, dynamic programming algorithm, polynomial algorithm, Programming involving graphs or networks, quasi-polynomial algorithm
Beschreibung:	Summary: The author presents three new models of combinatorial optimization problems. Especially, a polynomial algorithm and a quasi-polynomial algorithm are given, their complexities are \(O(N^2)\) and \(O(N^2a)\), respectively.
Publikationsart:	Article
Dateibeschreibung:	application/xml
Zugangs-URL:	https://zbmath.org/1382333
Dokumentencode:	edsair.c2b0b933574d..bf50db6e2bcbe0cb93bc1fea499b1333
Datenbank:	OpenAIRE

Beschreibung
Abstract:	Summary: The author presents three new models of combinatorial optimization problems. Especially, a polynomial algorithm and a quasi-polynomial algorithm are given, their complexities are \(O(N^2)\) and \(O(N^2a)\), respectively.