IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v150y2007i1p159-17510.1007-s10479-006-0156-y.html
   My bibliography  Save this article

Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems

Author

Listed:
  • Javier Marenco
  • Annegret Wagler

Abstract

Point-to-Multipoint systems are a kind of radio systems supplying wireless access to voice/data communication networks. Such systems have to be run using a certain frequency spectrum, which typically causes capacity problems. Hence it is, on the one hand, necessary to reuse frequencies but, on the other hand, no interference must be caused thereby. This leads to a combinatorial optimization problem, the bandwidth allocation problem, a special case of so-called chromatic scheduling problems. Both problems are NP-hard and it is known that, for these problems, there exist no polynomial time algorithms with a fixed approximation ratio. Algorithms based on cutting planes have shown to be successful for many other combinatorial optimization problems. In order to apply such methods, knowledge on the associated polytopes is required. The present paper contributes to this issue, exploring basic properties of chromatic scheduling polytopes and several classes of facet-defining inequalities. Copyright Springer Science+Business Media, LLC 2007

Suggested Citation

  • Javier Marenco & Annegret Wagler, 2007. "Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems," Annals of Operations Research, Springer, vol. 150(1), pages 159-175, March.
    • Handle: RePEc:spr:annopr:v:150:y:2007:i:1:p:159-175:10.1007/s10479-006-0156-y
    DOI: 10.1007/s10479-006-0156-y
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-006-0156-y
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-006-0156-y?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.

    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:150:y:2007:i:1:p:159-175:10.1007/s10479-006-0156-y. 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.