Lower bounding techniques for frequency assignment

DOI10.1016/S0012-365X(99)90037-7zbMATH Open0956.90057OpenAlexW4210471073MaRDI QIDQ1292811FDOQ1292811

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 algorithmsgraph colouringsfrequency assignment problem

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Symmetric traveling salesman problems
• Improving heuristics for the frequency assignment 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 Staged Primal-Dual Algorithm for Finding a Minimum Cost Perfect Two-Matching in an Undirected Graph
• Bounds for the frequency assignment problem

Cited In (5)

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

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)