A class of special combinatorial optimization problems and their algorithms
Saved in:
| Title: | A class of special combinatorial optimization problems and their algorithms |
|---|---|
| Authors: | Luo, Zongjun |
| Publisher Information: | Editorial Board of Mathematica Applicata, Huazhong University of Science and Technology, Wuhan |
| Subject Terms: | Combinatorial optimization, dynamic programming algorithm, polynomial algorithm, Programming involving graphs or networks, quasi-polynomial algorithm |
| Description: | 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. |
| Document Type: | Article |
| File Description: | application/xml |
| Access URL: | https://zbmath.org/1382333 |
| Accession Number: | edsair.c2b0b933574d..bf50db6e2bcbe0cb93bc1fea499b1333 |
| Database: | OpenAIRE |
Nájsť tento článok vo Web of Science Be the first to leave a comment!