Improving heuristics for the frequency assignment problem

DOI10.1016/S0377-2217(98)80006-4zbMath0943.90056OpenAlexW1974105863MaRDI QIDQ1296060

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

zbMATH Keywords

heuristicsgraph theoryfrequency assignment

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items

An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem ⋮ Optimized planning of frequency hopping in cellular networks ⋮ \(L(3,2,1)\)-labeling of triangular and toroidal grids ⋮ Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm ⋮ An exact algorithm with learning for the graph coloring problem ⋮ New variable neighborhood search method for minimum sum coloring problem on simple graphs ⋮ Models and methods for frequency assignment with cumulative interference constraints ⋮ An enumerative algorithm for the frequency assignment problem ⋮ Coloring large graphs based on independent set extraction ⋮ Improving the extraction and expansion method for large graph coloring ⋮ Polyhedral studies for minimum‐span graph labelling with integer distance constraints ⋮ Models and solution techniques for frequency assignment problems ⋮ A memetic algorithm for graph coloring ⋮ Lower bounding techniques for frequency assignment ⋮ Improving heuristics for the frequency assignment problem ⋮ Graph imperfection. I ⋮ AN EXTRACTION AND EXPANSION APPROACH FOR GRAPH COLORING ⋮ Generation of lower bounds for minimum span frequency assignment

Uses Software

• FASoft

Cites Work

• Unnamed Item
• 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
• \(T\)-colorings of graphs: recent results and open problems
• Improving heuristics for the frequency assignment problem
• Bounds for the frequency assignment problem
• A tabu search algorithm for frequency assignment
• On the use of some known methods for \(T\)-colorings of graphs
• Solving the maximum clique problem using a tabu search approach
• Sur le coloriage des graphs