Name
Abstract | ||
|---|---|---|
We present a primal-dual algorithm for solving the minimum average weighted length circuit problem. The algorithm solves the problem by solving a series of subproblems with more combinatorial aspects iteratively. We also prove that the complexity of the algorithm is O(n4 max{t(ij)}) and show that our algorithm is actually a generalization of the Karp-Orlin algorithm. Finally, the relationship between the two algorithms is discussed. |
Year | DOI | Venue |
|---|---|---|
1991 | 10.1002/net.3230210702 | NETWORKS |
Field | DocType | Volume |
Graph theory,Mathematical optimization,Combinatorics,Diffusing update algorithm,Algorithmics,Ramer–Douglas–Peucker algorithm,Out-of-kilter algorithm,Algorithm,Suurballe's algorithm,Freivalds' algorithm,Cornacchia's algorithm,Mathematics | Journal | 21 |
Issue | ISSN | Citations |
7 | 0028-3045 | 1 |
PageRank | References | Authors |
0.61 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chengen Yang | 1 | 56 | 5.47 |
| Dayong Jin | 2 | 1 | 0.94 |