Minimizing the span d-walks to compute optimum frequency assignments.

DOI10.1007/S101070100247MaRDI QIDQ5957570zbMATH OpenOpenAlexFDO

Authors Alessandro Avenali, Carlo Mannino, Antonio Sassano

Publication date 2002

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s101070100247

zbMATH Keywords

radio network designtelecommunication systems

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Programming involving graphs or networks (90C35)

Recommendations

• Bounds for the frequency assignment problem
• scientific article; zbMATH DE number 1795728
• Models and solution techniques for frequency assignment problems
• Approximation Algorithms for Minimum Span Channel Assignment Problems
• scientific article; zbMATH DE number 1488080

Cited in

(3)

• Polyhedral studies for minimum‐span graph labelling with integer distance constraints
• Models and solution techniques for frequency assignment problems
• A memetic algorithm for channel assignment in wireless FDMA systems

This page was built for publication: Minimizing the span \(d\)-walks to compute optimum frequency assignments.

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