A class of special combinatorial optimization problems and their algorithms
Uloženo v:
| Název: | A class of special combinatorial optimization problems and their algorithms |
|---|---|
| Autoři: | Luo, Zongjun |
| Informace o vydavateli: | Editorial Board of Mathematica Applicata, Huazhong University of Science and Technology, Wuhan |
| Témata: | 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 souboru: | application/xml |
| Přístupová URL adresa: | https://zbmath.org/1382333 |
| Přístupové číslo: | edsair.c2b0b933574d..bf50db6e2bcbe0cb93bc1fea499b1333 |
| Databáze: | OpenAIRE |
Nájsť tento článok vo Web of Science Buďte první, kdo okomentuje tento záznam!