A Beam Search Method to Solve the Problem of Assignment Cells to Switches in a Cellular Mobile Network

dc.contributorUniversidade Estadual Paulista (Unesp)
dc.date.accessioned2014-05-20T13:27:58Z
dc.date.available2014-05-20T13:27:58Z
dc.date.created2014-05-20T13:27:58Z
dc.date.issued2009-01-01
dc.identifierRecent Advances In Applied Mathematics. Athens: World Scientific and Engineering Acad and Soc, p. 99-105, 2009.
dc.identifierhttp://hdl.handle.net/11449/9284
dc.identifierWOS:000276837500015
dc.identifier1474939605572095
dc.description.abstractAssigning cells to switches in a cellular mobile network is known as an NP-hard optimization problem. This means that the alternative for the solution of this type of problem is the use of heuristic methods, because they allow the discovery of a good solution in a very satisfactory computational time. This paper proposes a Beam Search method to solve the problem of assignment cell in cellular mobile networks. Some modifications in this algorithm are also presented, which allows its parallel application. Computational results obtained from several tests confirm the effectiveness of this approach and provide good solutions for large scale problems.
dc.languageeng
dc.publisherWorld Scientific and Engineering Acad and Soc
dc.relationRecent Advances In Applied Mathematics
dc.rightsAcesso restrito
dc.sourceWeb of Science
dc.subjectCombinatorial Optimization
dc.subjectAssignment Problem
dc.subjectBeam Search Method
dc.subjectCellular Network
dc.subjectQuadratic Integer Programming
dc.titleA Beam Search Method to Solve the Problem of Assignment Cells to Switches in a Cellular Mobile Network
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución