Mathematical Programming: Series A and B
Quadratic 0/1 optimization and a decomposition approach for the placement of electronic circuits
Mathematical Programming: Series A and B
A polynomial algorithm for the k-cut problem for fixed k
Mathematics of Operations Research
Assignment of cells to switches in PCS networks
IEEE/ACM Transactions on Networking (TON)
Formulations and valid inequalities for the node capacitated graph partitioning problem
Mathematical Programming: Series A and B
Fast and effective algorithms for graph partitioning and sparse-matrix ordering
IBM Journal of Research and Development - Special issue: optical lithography I
Multilevel k-way partitioning scheme for irregular graphs
Journal of Parallel and Distributed Computing
The node capacitated graph partitioning problem: a computational study
Mathematical Programming: Series A and B - Special issue on computational integer programming
Multilevel hypergraph partitioning: applications in VLSI domain
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
Fast approximate graph partitioning algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
GSM, GPRS and EDGE Performance: Evolution Toward 3G/UMTS
GSM, GPRS and EDGE Performance: Evolution Toward 3G/UMTS
Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm
SIAM Journal on Scientific Computing
A Simple Heuristic for Assignment of Cells to Switches in a PCS Network
Wireless Personal Communications: An International Journal
Genetic Algorithm and Graph Partitioning
IEEE Transactions on Computers
IEEE Transactions on Pattern Analysis and Machine Intelligence
Lower Bounds and Exact Algorithms for the Graph Partitioning Problem Using Multicommodity Flows
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Optimal Location Area Design to Minimize Registration Signaling Traffic in Wireless Systems
IEEE Transactions on Mobile Computing
A linear-time heuristic for improving network partitions
DAC '82 Proceedings of the 19th Design Automation Conference
Graph partitioning for high-performance scientific simulations
Sourcebook of parallel computing
Improving Discrete Model Representations via Symmetry Considerations
Management Science
A Combined Evolutionary Search and Multilevel Optimisation Approach to Graph-Partitioning
Journal of Global Optimization
Efficient location area planning for cellular networks with hierarchical location databases
Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient location area planning for personal communication systems
IEEE/ACM Transactions on Networking (TON)
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Analysis of Heuristic Graph Partitioning Methods for the Assignment of Packet Control Units in GERAN
Wireless Personal Communications: An International Journal
A flexible algorithm for sensor network partitioning and self-partitioning problems
ALGOSENSORS'06 Proceedings of the Second international conference on Algorithmic Aspects of Wireless Sensor Networks
Location area planning and cell-to-switch assignment in cellular networks
IEEE Transactions on Wireless Communications
An approach for location area planning in a personal communication services network (PCSN)
IEEE Transactions on Wireless Communications
A tabu search approach for assigning cells to switches in cellular mobile networks
Computer Communications
Cliques and clustering: A combinatorial approach
Operations Research Letters
Hi-index | 0.00 |
In mobile networks, the assignment of base stations to controllers when planning the network has a strong impact on network performance. In a previous paper, the authors formulated the assignment of base stations to packet controllers in GSM-EDGE Radio Access Network (GERAN) as a graph partitioning problem, which was solved by a heuristic method. In this paper, an exact method is presented to find optimal solutions that can be used as a benchmark. The proposed method is based on an effective re-formulation of the classical integer linear programming model of the graph partitioning problem, which is solved by the branch-and-cut algorithm in a commercial optimization package. Performance assessment is based on an extensive set of problem instances built from data of a live network. Preliminary analysis shows some properties of the graphs in this problem justifying the limitations of heuristic approaches and the need for more sophisticated methods. Results show that the proposed method outperforms classical heuristic algorithms used for benchmarking, even under runtime constraints. Likewise, it improves the efficiency of exact methods previously applied to similar problems in the cellular field.