A Fast Terminal Matching Method for Interference Coordination Based on Wavelet Transform and Graph Theory in Ultra-Dense Multi-Cell Scenarios

Gou, Junxiang; Wang, Lusheng; Lin, Hai; Peng, Min; Kai, Caihong

doi:10.1109/access.2021.3124361

Cited by 2 publications

(1 citation statement)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Later, scholars mainly focused on the study of approximate solutions to the multidimensional assignment problem, Heuristic algorithms [14], genetic algorithms [15], and hybrid genetic algorithms [16] have been proposed for solving three-dimensional assignment problems. In recent years, research has mainly focused on the stability and asymptotic behavior of solutions [17][18][19][20].…”

Section: Introductionmentioning

confidence: 99%

An Algorithm for Solving Three-dimensional Assignment Problem

Zhitao Xiao

2024

jes

View full text Add to dashboard Cite

This article presents a algorithm for solving Three-dimensional assignment problem. Firstly, decompose the three-dimensional cubic matrix corresponding to the three-dimensional assignment problem into multiple two-dimensional planar matrices, and obtain that the assignment problems corresponding to these two-dimensional planar matrices have the same feasible solution as the original three-dimensional assignment problem. Then, the leading principal submatrix algorithm is used to solve each two-dimensional assignment problem. The characteristic of the leading principal submatrix algorithm is that each operation only needs to consider the local (leading principal submatrix) of the assignment matrix of the two-dimensional assignment matrix, without considering the entire assignment matrix. Starting from the first-order leading principal submatrix of the assignment matrix, Through the same solution transformation, the row minimum element of the leading principal submatrix of each order of the assignment matrix is found step by step, and the optimal solution of the two-dimensional assignment problems are obtained. Finally, by comparing the optimal solutions of these two-dimensional assignment problems, the optimal solutions of the original three-dimensional assignment problems are obtained. This algorithm can find the optimal solution for three-dimensional assignment problems in a patterned manner, facilitating computer programming and handling assignment problems with a large number of people and tasks.

show abstract