Lower bounds for fixed spectrum frequency assignment
From MaRDI portal
Recommendations
- An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem
- scientific article; zbMATH DE number 1488080
- Generation of lower bounds for minimum span frequency assignment
- Lower bounding techniques for frequency assignment
- Characteristics of good meta-heuristic algorithms for the frequency assignment problem
Cited in
(14)- Maximum independent sets and supervised learning
- Domination analysis of greedy heuristics for the frequency assignment problem.
- Frequency assignment problem in networks with limited spectrum
- Multi-neighborhood simulated annealing for the minimum interference frequency assignment problem
- Heuristic manipulation, tabu search and frequency assignment
- Upper and lower bounds for the fixed spectrum frequency assignment problem. (Abstract of thesis)
- Characteristics of good meta-heuristic algorithms for the frequency assignment problem
- Generation of lower bounds for minimum span frequency assignment
- Upper and lower bounds based on linear programming for the b-coloring problem
- An optimisation model for minimising changes in frequency allocations
- Performance evaluation and system optimization of Green cognitive radio networks with a multiple-sleep mode
- Models and solution techniques for frequency assignment problems
- An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem
- scientific article; zbMATH DE number 1302022 (Why is no real title available?)
This page was built for publication: Lower bounds for fixed spectrum frequency assignment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1599346)
