Improving heuristics for the frequency assignment problem
From MaRDI portal
Publication:1296060
DOI10.1016/S0377-2217(98)80006-4zbMATH Open0943.90056OpenAlexW1974105863MaRDI QIDQ1296060FDOQ1296060
Authors: S. U. Thiel, Derek H. Smith, Steve Hurley 
Publication date: 11 July 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(98)80006-4
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Cites Work
- Sur le coloriage des graphs
- \(T\)-colorings of graphs: recent results and open problems
- Improving heuristics for the frequency assignment problem
- Solving the maximum clique problem using a tabu search approach
- An exact algorithm for the maximum clique problem
- A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
- On the use of some known methods for \(T\)-colorings of graphs
- A tabu search algorithm for frequency assignment
- Bounds for the frequency assignment problem
- Title not available (Why is that?)
Cited In (24)
- Generation of lower bounds for minimum span frequency assignment
- An enumerative algorithm for the frequency assignment problem
- Upper and lower bounds for the fixed spectrum frequency assignment problem. (Abstract of thesis)
- An extraction and expansion approach for graph coloring
- An heuristic search technique for fixed frequency assignment in non-homogeneous demand systems
- Improving the extraction and expansion method for large graph coloring
- Optimized planning of frequency hopping in cellular networks
- Graph imperfection. I
- Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm
- \(L(3,2,1)\)-labeling of triangular and toroidal grids
- Lower bounding techniques for frequency assignment
- Polyhedral studies for minimum‐span graph labelling with integer distance constraints
- Optimal multiple interval assignments in frequency assignment and traffic phasing
- A memetic algorithm for graph coloring
- Models and methods for frequency assignment with cumulative interference constraints
- An exact algorithm with learning for the graph coloring problem
- Improving heuristics for the frequency assignment problem
- Models and solution techniques for frequency assignment problems
- Algorithms for the generalized weighted frequency assignment problem
- Characteristics of good meta-heuristic algorithms for the frequency assignment problem
- New variable neighborhood search method for minimum sum coloring problem on simple graphs
- An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem
- Domination analysis of greedy heuristics for the frequency assignment problem.
- Coloring large graphs based on independent set extraction
Uses Software
This page was built for publication: Improving heuristics for the frequency assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296060)
