Models and solution techniques for frequency assignment problems
From MaRDI portal
Publication:5920489
DOI10.1007/s10479-007-0178-0zbMath1157.90005OpenAlexW2141082967MaRDI QIDQ5920489
Arie M. C. A. Koster, Antonio Sassano, Karen Aardal, Stan P. M. van Hoesel, Carlo Mannino
Publication date: 31 March 2008
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-007-0178-0
heuristicschannel assignmentwireless networksfrequency assignmentexact methodsmathematical optimization models
Nonlinear programming (90C30) Communication networks in operations research (90B18) Management decision making, including multiple objectives (90B50) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Circular backbone colorings: on matching and tree backbones of planar graphs, Accurate optimization models for interference constrained bandwidth allocation in cellular networks, On Conflict-Free Multi-coloring, The dynamic frequency assignment problem, Fast heuristics for the frequency channel assignment problem in multi-hop wireless networks, Computational complexity of distance edge labeling, Algorithms for the generalized weighted frequency assignment problem, Spectrum graph coloring and applications to Wi-Fi channel assignment, Frequency reassignment problem in mobile communication networks, Frequency assignment in a SDMA satellite communication system with beam decentring feature, Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks, An exact algorithm for the edge coloring by total labeling problem, \(L(2, 1)\)-labeling of the Cartesian and strong product of two directed cycles, Two-stage multi-neighborhood simulated annealing for uncapacitated examination timetabling, A supernodal formulation of vertex colouring with applications in course timetabling, Exact and approximate methods for the score-constrained packing problem, Weighted improper colouring, Spectrum graph coloring to improve Wi-Fi channel assignment in a real-world scenario via edge contraction, Lower and upper bounds for the bin packing problem with fragile objects, A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem, Multi-neighborhood simulated annealing for the minimum interference frequency assignment problem, The Importance of Proper Diversity Management in Evolutionary Algorithms for Combinatorial Optimization, Proper colorability of segment intersection graphs, An optimisation model for minimising changes in frequency allocations, Collective dynamics of phase-repulsive oscillators solves graph coloring problem, Optimal deployment of indoor wireless local area networks, An efficient self-stabilizing distance-2 coloring algorithm, Domination analysis of greedy heuristics for the frequency assignment problem., \(L(2,1)\)-labelings of some families of oriented planar graphs, Constraint and Satisfiability Reasoning for Graph Coloring, \(L(2,1)\)-labeling of oriented planar graphs, Note on coloring of double disk graphs, Methods for operations planning in airport decision support systems, Price of anarchy for graph coloring games with concave payoff, A two-level graph partitioning problem arising in mobile wireless communications, Matchings under distance constraints. I, Bounds on spectrum graph coloring, A column generation based algorithm for the robust graph coloring problem, Partial integration of frequency allocation within antenna positioning in GSM mobile networks, An evolutionary approach for bandwidth multicoloring problems, Methods for operations planning in airport decision support systems, Modeling the packing coloring problem of graphs, Unnamed Item, Polyhedral studies for minimum‐span graph labelling with integer distance constraints, Frequency assignment problem in satellite communications using differential evolution, Absolute and asymptotic bounds for online frequency allocation in cellular networks, Contrast in greyscales of graphs, Labeling trees with a condition at distance two, \(L(h,k)\)-labelings of Hamming graphs, Graphs and Algorithms in Communication Networks on Seven League Boots, Mathematical Optimization Models for WLAN Planning, An Efficient Self-stabilizing Distance-2 Coloring Algorithm, The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg, Deriving bounds on \(L(k_1,k_2)\) labeling of triangular lattice by exploring underlined graph structures, Total tessellation cover: bounds, hardness, and applications, A hybrid neural-genetic algorithm for the frequency assignment problem in satellite communications
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- LSSPER: Solving the resource-constrained project scheduling problem with large neighbourhood search
- Lower bounding and tabu search procedures for the frequency assignment problem with polarization constraints
- Soft arc consistency revisited
- A randomised 3-colouring algorithm
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- Optimal assignment of broadcasting frequencies
- An interior point algorithm to solve computationally difficult set covering problems
- \(T\)-colorings of graphs: recent results and open problems
- Lower bounding techniques for frequency assignment
- Radio link frequency assignment
- Improving heuristics for the frequency assignment problem
- The partial constraint satisfaction problem: Facets and lifting theorems
- A linear description of the discrete lot-sizing and scheduling problem
- Channel allocation in cellular radio networks
- A potential reduction approach to the frequency assignment problem
- Frequency assignment in cellular phone networks
- An enumerative algorithm for the frequency assignment problem
- Domination analysis of greedy heuristics for the frequency assignment problem.
- Frequency assignment in mobile radio systems using branch-and-cut techniques
- Optimal base station positioning and channel assignment for 3G mobile networks by integer programming
- Lower bounds for fixed spectrum frequency assignment
- Characteristics of good meta-heuristic algorithms for the frequency assignment problem
- Erratum to ``Comparison of column generation models for channel assignment in cellular networks
- An exact algorithm for the channel assignment problem
- Efficient filtering and tabu search on a consistent neighbourhood for the frequency assignment problem with polarisation
- A general approach for constraint solving by local search
- An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem
- Optimized planning of frequency hopping in cellular networks
- Hierarchical cellular network design with channel allocation
- A tabu search algorithm for frequency assignment
- On the use of some known methods for \(T\)-colorings of graphs
- Solving the frequency assignment problem with polarization by local search and tabu
- Tabu search for frequency assignment in mobile radio networks
- Algorithms for Radio Link Frequency Assignment: The Calma Project
- New methods to color the vertices of a graph
- Optimal radio channel assignment through a new binary dynamic simulated annealing algorithm
- Further Results on T-Coloring and Frequency Assignment Problems
- A Column Generation Approach for Graph Coloring
- Solving partial constraint satisfaction problems with tree decomposition
- Frequency planning and ramifications of coloring
- APPLICATION OF THE GRAPH COLORING ALGORITHM TO THE FREQUENCY ASSIGNMENT PROBLEM
- Lower Bounds from Tile Covers for the Channel Assignment Problem
- A genetic algorithm for the partial binary constraint satisfaction problem: an application to a frequency assignment problem
- Models and solution techniques for frequency assignment problems
- Minimizing the span \(d\)-walks to compute optimum frequency assignments.
