Frequency assignment in cellular phone networks

DOI10.1023/A:1018908907763zbMath0895.90090OpenAlexW2098112491MaRDI QIDQ1383122

Martin Grötschel, Alexander Martin, Andreas Eisenblätter, Ralf Borndörfer

Publication date: 20 September 1998

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018908907763

zbMATH Keywords

heuristicsgraph coloringfrequency assignment problemassignment heuristicscellular phone network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Communication networks in operations research (90B18)

Related Items

Optimized planning of frequency hopping in cellular networks, Facet-inducing inequalities and a cut-and-branch for the bandwidth coloring polytope based on the orientation model, The minimum chromatic violation problem: a polyhedral approach, Models and methods for frequency assignment with cumulative interference constraints, Multi-neighborhood simulated annealing for the minimum interference frequency assignment problem, Domination analysis of greedy heuristics for the frequency assignment problem., A column generation and branch-and-cut algorithm for the channel assignment problem, Polyhedral studies of vertex coloring problems: the standard formulation, Comparison of column generation models for channel assignment in cellular networks, Polyhedral studies for minimum‐span graph labelling with integer distance constraints, Models and solution techniques for frequency assignment problems, Graphs and Algorithms in Communication Networks on Seven League Boots, Frequency assignment in mobile radio systems using branch-and-cut techniques, Erratum to ``Comparison of column generation models for channel assignment in cellular networks