IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v107y2001i1p237-25010.1023-a1014911401612.html
   My bibliography  Save this article

Lower Bounds for Fixed Spectrum Frequency Assignment

Author

Listed:
  • R. Montemanni
  • D.H. Smith
  • S.M. Allen

Abstract

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. Copyright Kluwer Academic Publishers 2001

Suggested Citation

  • R. Montemanni & D.H. Smith & S.M. Allen, 2001. "Lower Bounds for Fixed Spectrum Frequency Assignment," Annals of Operations Research, Springer, vol. 107(1), pages 237-250, October.
    • Handle: RePEc:spr:annopr:v:107:y:2001:i:1:p:237-250:10.1023/a:1014911401612
    DOI: 10.1023/A:1014911401612
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1014911401612
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1014911401612?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Montemanni, R. & Smith, D. H. & Allen, S. M., 2004. "An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem," European Journal of Operational Research, Elsevier, vol. 156(3), pages 736-751, August.
    2. Jianping Liu & Shunfu Jin & Wuyi Yue, 2019. "Performance evaluation and system optimization of Green cognitive radio networks with a multiple-sleep mode," Annals of Operations Research, Springer, vol. 277(2), pages 371-391, June.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:107:y:2001:i:1:p:237-250:10.1023/a:1014911401612. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.