Lower bounding techniques for frequency assignment

DOI10.1016/S0012-365X(99)90037-7MaRDI QIDQ1292811zbMATH OpenOpenAlexFDO

Authors 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

frequency assignment problemgraph colouringsheuristic algorithmslower bounds

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1488080
• Improving heuristics for the frequency assignment problem
• An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem
• Generation of lower bounds for minimum span frequency assignment
• Lower bounds for fixed spectrum frequency assignment

Cites work

• A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
• A Staged Primal-Dual Algorithm for Finding a Minimum Cost Perfect Two-Matching in an Undirected Graph
• Bounds for the frequency assignment problem
• scientific article; zbMATH DE number 871931 (Why is no real title available?)
• Improving heuristics for the frequency assignment problem
• On the use of some known methods for \(T\)-colorings of graphs
• Symmetric traveling salesman problems
• The Lagrangian Relaxation Method for Solving Integer Programming Problems

Cited in

(11)

• 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
• Generation of lower bounds for minimum span frequency assignment
• An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem
• Optimized planning of frequency hopping in cellular networks
• On interference graphs
• 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
• Lower bounding and tabu search procedures for the frequency assignment problem with polarization constraints

Describes a project that uses

Uses Software

• FASoft

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292811)