An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem
From MaRDI portal
(Redirected from Publication:1877917)
Recommendations
- Lower bounds for fixed spectrum frequency assignment
- Upper and lower bounds for the fixed spectrum frequency assignment problem. (Abstract of thesis)
- Lower bounding techniques for frequency assignment
- Lower bounding and tabu search procedures for the frequency assignment problem with polarization constraints
- Bounds for the frequency assignment problem
- Frequency assignment problem in networks with limited spectrum
- Generation of lower bounds for minimum span frequency assignment
- scientific article; zbMATH DE number 1488080
- On the solution of generalized spectrum allocation problems
Cites work
- A Spectral Bundle Method for Semidefinite Programming
- A tabu search algorithm for frequency assignment
- Algorithm 457: finding all cliques of an undirected graph
- Improving heuristics for the frequency assignment problem
- Lower bounding techniques for frequency assignment
- Lower bounds for fixed spectrum frequency assignment
- The partial constraint satisfaction problem: Facets and lifting theorems
Cited in
(15)- Heuristic manipulation, tabu search and frequency assignment
- Lower bounding techniques for frequency assignment
- Improving heuristics for the frequency assignment problem
- Upper and lower bounds for the fixed spectrum frequency assignment problem. (Abstract of thesis)
- Lower bounds for fixed spectrum frequency assignment
- Characteristics of good meta-heuristic algorithms for the frequency assignment problem
- Generation of lower bounds for minimum span frequency assignment
- Frequency assignment problem in networks with limited spectrum
- scientific article; zbMATH DE number 1488080 (Why is no real title available?)
- Lower Bounds from Tile Covers for the Channel Assignment Problem
- Models and solution techniques for frequency assignment problems
- Multi-neighborhood simulated annealing for the minimum interference frequency assignment problem
- Upper and lower bounds based on linear programming for the b-coloring problem
- An optimisation model for minimising changes in frequency allocations
- Revisiting wireless network jamming by SIR-based considerations and multiband robust optimization
This page was built for publication: An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1877917)