A class of special combinatorial optimization problems and their algorithms
Uložené v:
| Názov: | A class of special combinatorial optimization problems and their algorithms |
|---|---|
| Autori: | Luo, Zongjun |
| Informácie o vydavateľovi: | Editorial Board of Mathematica Applicata, Huazhong University of Science and Technology, Wuhan |
| Predmety: | Combinatorial optimization, dynamic programming algorithm, polynomial algorithm, Programming involving graphs or networks, quasi-polynomial algorithm |
| Popis: | 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. |
| Druh dokumentu: | Article |
| Popis súboru: | application/xml |
| Prístupová URL adresa: | https://zbmath.org/1382333 |
| Prístupové číslo: | edsair.c2b0b933574d..bf50db6e2bcbe0cb93bc1fea499b1333 |
| Databáza: | OpenAIRE |
Nájsť tento článok vo Web of Science Buďte prvý, kto okomentuje tento záznam!