Models and solution techniques for frequency assignment problems
From MaRDI portal
(Redirected from Publication:5920489)
Models and solution techniques for frequency assignment problems (scientific article; zbMATH DE number 5255850)
Models and solution techniques for frequency assignment problems (scientific article; zbMATH DE number 5255850)
Recommendations
Cites work
- scientific article; zbMATH DE number 6118222 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3503127 (Why is no real title available?)
- scientific article; zbMATH DE number 1114012 (Why is no real title available?)
- scientific article; zbMATH DE number 1361465 (Why is no real title available?)
- scientific article; zbMATH DE number 2086928 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 1865936 (Why is no real title available?)
- A Column Generation Approach for Graph Coloring
- A general approach for constraint solving by local search
- A genetic algorithm for the partial binary constraint satisfaction problem: an application to a frequency assignment problem
- A linear description of the discrete lot-sizing and scheduling problem
- A potential reduction approach to the frequency assignment problem
- A randomised 3-colouring algorithm
- A tabu search algorithm for frequency assignment
- APPLICATION OF THE GRAPH COLORING ALGORITHM TO THE FREQUENCY ASSIGNMENT PROBLEM
- Algorithms for Radio Link Frequency Assignment: The Calma Project
- An enumerative algorithm for the frequency assignment problem
- An exact algorithm for the channel assignment problem
- An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem
- An interior point algorithm to solve computationally difficult set covering problems
- Channel allocation in cellular radio networks
- Characteristics of good meta-heuristic algorithms for the frequency assignment problem
- Domination analysis of greedy heuristics for the frequency assignment problem.
- Efficient filtering and tabu search on a consistent neighbourhood for the frequency assignment problem with polarisation
- Erratum to ``Comparison of column generation models for channel assignment in cellular networks
- Frequency assignment in cellular phone networks
- Frequency assignment in mobile radio systems using branch-and-cut techniques
- Frequency planning and ramifications of coloring
- Further Results on T-Coloring and Frequency Assignment Problems
- Hierarchical cellular network design with channel allocation
- Improving heuristics for the frequency assignment problem
- LSSPER: Solving the resource-constrained project scheduling problem with large neighbourhood search
- Lower Bounds from Tile Covers for the Channel Assignment Problem
- Lower bounding and tabu search procedures for the frequency assignment problem with polarization constraints
- Lower bounding techniques for frequency assignment
- Lower bounds for fixed spectrum frequency assignment
- Minimizing the span \(d\)-walks to compute optimum frequency assignments.
- Models and solution techniques for frequency assignment problems
- New methods to color the vertices of a graph
- On the use of some known methods for \(T\)-colorings of graphs
- Optimal assignment of broadcasting frequencies
- Optimal base station positioning and channel assignment for 3G mobile networks by integer programming
- Optimal radio channel assignment through a new binary dynamic simulated annealing algorithm
- Optimized planning of frequency hopping in cellular networks
- Radio link frequency assignment
- Soft arc consistency revisited
- Solving partial constraint satisfaction problems with tree decomposition
- Solving the frequency assignment problem with polarization by local search and tabu
- Tabu search for frequency assignment in mobile radio networks
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- The partial constraint satisfaction problem: Facets and lifting theorems
- \(T\)-colorings of graphs: recent results and open problems
Cited in
(80)- Partial integration of frequency allocation within antenna positioning in GSM mobile networks
- scientific article; zbMATH DE number 5929600 (Why is no real title available?)
- Constraint and satisfiability reasoning for graph coloring
- Decomposition Based Heuristic Approach to Frequency Reassignment Problem
- An exact site availability approach to modeling the D-FAP
- An efficient self-stabilizing distance-2 coloring algorithm
- Search Intensification in Metaheuristics for Solving the Automatic Frequency Problem in GSM
- A proven optimal result for a benchmark instance of the uncapacitated examination timetabling problem
- Models and solution techniques for frequency assignment problems
- Mathematical optimization models for WLAN planning
- Absolute and asymptotic bounds for online frequency allocation in cellular networks
- Lower and upper bounds for the bin packing problem with fragile objects
- A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem
- Affine optimal k-proper connected edge colorings
- Labeling trees with a condition at distance two
- Proper colorability of segment intersection graphs
- Methods for operations planning in airport decision support systems
- Methods for operations planning in airport decision support systems
- Weighted improper colouring
- Modeling the packing coloring problem of graphs
- An heuristic search technique for fixed frequency assignment in non-homogeneous demand systems
- The importance of proper diversity management in evolutionary algorithms for combinatorial optimization
- Chance-constrained optimization of reliable fixed broadband wireless networks
- Minimizing the span \(d\)-walks to compute optimum frequency assignments.
- Circular backbone colorings: on matching and tree backbones of planar graphs
- Accurate optimization models for interference constrained bandwidth allocation in cellular networks
- Matchings under distance constraints. I
- A two-level graph partitioning problem arising in mobile wireless communications
- Optimising channel assignments for private mobile radio networks in the UHF 2 band
- Total tessellation cover: bounds, hardness, and applications
- An efficient self-stabilizing distance-2 coloring algorithm
- L(h,k)-labelings of Hamming graphs
- An exact algorithm for the edge coloring by total labeling problem
- Matchings under distance constraints. II.
- Frequency planning and ramifications of coloring
- An optimisation model for minimising changes in frequency allocations
- The fine-grained complexity of approximately counting proper connected colorings (extended abstract)
- Frequency reassignment problem in mobile communication networks
- Polyhedral studies for minimum‐span graph labelling with integer distance constraints
- Optimal deployment of indoor wireless local area networks
- A comparison of a global approach and a decomposition method for frequency assignment in multibeam satellite systems
- Fast heuristics for the frequency channel assignment problem in multi-hop wireless networks
- Graphs and algorithms in communication networks on seven league boots
- A supernodal formulation of vertex colouring with applications in course timetabling
- On the solution of generalized spectrum allocation problems
- Spectrum graph coloring and applications to Wi-Fi channel assignment
- \(L(2, 1)\)-labeling of the Cartesian and strong product of two directed cycles
- A hybrid neural-genetic algorithm for the frequency assignment problem in satellite communications
- Models and methods for frequency assignment with cumulative interference constraints
- Proper colorability of segment intersection graphs
- Note on coloring of double disk graphs
- On solution discovery via reconfiguration
- scientific article; zbMATH DE number 1865936 (Why is no real title available?)
- Algorithms for the generalized weighted frequency assignment problem
- 2-dipath and oriented L(2, 1)-labelings of some families of oriented planar graphs
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- Characteristics of good meta-heuristic algorithms for the frequency assignment problem
- A Decomposed Approach for the Minimum Interference Frequency Assignment
- Exact and approximate methods for the score-constrained packing problem
- Two-stage multi-neighborhood simulated annealing for uncapacitated examination timetabling
- Collective dynamics of phase-repulsive oscillators solves graph coloring problem
- The frequency assignment problem: A solution via nonlinear programming
- Frequency assignment problem in satellite communications using differential evolution
- On conflict-free multi-coloring
- \(L(2,1)\)-labelings of some families of oriented planar graphs
- \(L(2,1)\)-labeling of oriented planar graphs
- Recognition and proper coloring of unit segment intersection graphs
- scientific article; zbMATH DE number 997663 (Why is no real title available?)
- Price of anarchy for graph coloring games with concave payoff
- The dynamic frequency assignment problem
- Deriving bounds on \(L(k_1,k_2)\) labeling of triangular lattice by exploring underlined graph structures
- Stochastic frequency assignment problem
- Bounds on spectrum graph coloring
- Domination analysis of greedy heuristics for the frequency assignment problem.
- Frequency assignment in a SDMA satellite communication system with beam decentring feature
- Contrast in greyscales of graphs
- Multi-neighborhood simulated annealing for the minimum interference frequency assignment problem
- A column generation based algorithm for the robust graph coloring problem
- Spectrum graph coloring to improve Wi-Fi channel assignment in a real-world scenario via edge contraction
- An evolutionary approach for bandwidth multicoloring problems
This page was built for publication: Models and solution techniques for frequency assignment problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5920489)
