A tabu search algorithm for frequency assignment
From MaRDI portal
Publication:1919845
DOI10.1007/BF02125459zbMath0851.90094MaRDI QIDQ1919845
Publication date: 28 July 1996
Published in: Annals of Operations Research (Search for Journal in Brave)
Related Items (11)
An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem ⋮ Optimized planning of frequency hopping in cellular networks ⋮ Bounds for the frequency assignment problem ⋮ Unnamed Item ⋮ Metaheuristics: A bibliography ⋮ An enumerative algorithm for the frequency assignment problem ⋮ Special structures in \(\mathcal{Q}(4, q)\), projective planes and its application in \(L(h, k)\)-colorings of their Moore graphs ⋮ A column generation and branch-and-cut algorithm for the channel assignment problem ⋮ Models and solution techniques for frequency assignment problems ⋮ Frequency assignment in mobile radio systems using branch-and-cut techniques ⋮ Improving heuristics for the frequency assignment problem
Uses Software
Cites Work
- Unnamed Item
- Least-cost network topology design for a new service: An application of tabu search
- Optimal multiple interval assignments in frequency assignment and traffic phasing
- Chromatic scheduling and frequency assignment
- On tabu search for the location of interacting hub facilities
- Future paths for integer programming and links to artificial intelligence
- Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
- A user's guide to tabu search
- A tabu-search heuristic for the flexible-resource flow shop scheduling problem
- Tabu search for a class of scheduling problems
- Massively parallel tabu search for the quadratic assignment problem
- On the use of some known methods for \(T\)-colorings of graphs
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- Solving real-life vehicle routing problems efficiently using tabu search
- Tabu Search—Part I
- Tabu Search—Part II
- Tabu Search Applied to the Quadratic Assignment Problem
- Bandwidth Packing: A Tabu Search Approach
- Algorithms for the Vehicle Routing Problems with Time Deadlines
- Capacitated clustering problems by hybrid simulated annealing and tabu search
This page was built for publication: A tabu search algorithm for frequency assignment