logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Lower bounds for fixed spectrum frequency assignment

delete2001-01-01
delete25
PRE
AI
R
Roberto Montemanni
D
Derek H. Smith *
S
Stuart M. Allen
DOI：10.1023/A:1014911401612delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Determining lower bounds for the sum of weighted constraint violations in fixed spectrum frequency assignment problems is important in order to evaluate the performance of heuristic algorithms. It is well known that, when adopting a binary constraints model, clique and near-clique subproblems have a dominant role in the theory of lower bounds for minimum span problems. In this paper we highlight their importance for fixed spectrum problems. We present a method based on the linear relaxation of an integer programming formulation of the problem, reinforced with constraints derived from clique-like subproblems. The results obtained are encouraging both in terms of quality and in terms of computation time.
Keywords:
radio frequency assignment
lower bounds
fixed spectrum problems
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Annals of Operations Research cover
Annals of Operations Research
IF:
4.5
Papers:
8.0K
Citations:
2.1W

Organization

No organization information available