Lower bounding techniques for frequency assignment

DOI10.1016/S0012-365X(99)90037-7zbMath0956.90057OpenAlexW4210471073MaRDI QIDQ1292811

K. Appert

Publication date: 18 March 2001

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)90037-7

zbMATH Keywords

lower boundsheuristic algorithmsfrequency assignment problemgraph colourings

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of graph theory (05C90) Combinatorial optimization (90C27)

Related Items (5)

An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem ⋮ Optimized planning of frequency hopping in cellular networks ⋮ Models and solution techniques for frequency assignment problems ⋮ On Interference Graphs ⋮ Generation of lower bounds for minimum span frequency assignment

Uses Software

• FASoft

Cites Work

• Unnamed Item
• Symmetric traveling salesman problems
• A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
• Improving heuristics for the frequency assignment problem
• Bounds for the frequency assignment problem
• On the use of some known methods for \(T\)-colorings of graphs
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• A Staged Primal-Dual Algorithm for Finding a Minimum Cost Perfect Two-Matching in an Undirected Graph

This page was built for publication: Lower bounding techniques for frequency assignment