Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

An enumerative algorithm for the frequency assignment problem

From MaRDI portal
Publication:1399116
Jump to:navigation, search

DOI10.1016/S0166-218X(02)00239-1zbMath1023.68004MaRDI QIDQ1399116

Antonio Sassano, Carlo Mannino

Publication date: 30 July 2003

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


zbMATH Keywords

telecommunication systemsfrequency assignment


Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)


Related Items (6)

BCH codes and distance multi- or fractional colorings in hypercubes asymptotically ⋮ Frequency assignment in a SDMA satellite communication system with beam decentring feature ⋮ Weighted improper colouring ⋮ Models and methods for frequency assignment with cumulative interference constraints ⋮ A comparison of problem decomposition techniques for the FAP ⋮ Models and solution techniques for frequency assignment problems



Cites Work

  • Improving heuristics for the frequency assignment problem
  • Bounds for the frequency assignment problem
  • Frequency assignment in mobile radio systems using branch-and-cut techniques
  • A tabu search algorithm for frequency assignment
  • On the use of some known methods for \(T\)-colorings of graphs
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item


This page was built for publication: An enumerative algorithm for the frequency assignment problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1399116&oldid=13554663"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 15:59.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki