IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-030-18500-8_1.html
   My bibliography  Save this book chapter

On a Polynomially Solvable Subclass of the Clique Problem with Applications in Energy-Efficient Timetabling

In: Operations Research Proceedings 2018

Author

Listed:
  • Patrick Gemander

    (FAU Erlangen-Nürnberg)

Abstract

The clique problem under multiple-choice constraints is an N P $${\mathcal {N}\mathcal {P}}$$ -hard variant of the general clique problem, which incorporates a structure commonly found in real-world applications like underground, railway or runway scheduling. It is relevant whenever there is a set of decisions with discrete options for each decision and possible conflicts between options. In this article, we identify a polynomial-time solvable subclass and determine its complete convex hull using graph-theoretic arguments related to perfect graphs. Since the convex hull can have exponentially many facets, we present criteria on how to more efficiently find the stable sets required to describe the convex hull as well as a polynomial-time separation algorithm. Finally, the theoretical results were successfully applied to energy-efficient underground and railway scheduling.

Suggested Citation

  • Patrick Gemander, 2019. "On a Polynomially Solvable Subclass of the Clique Problem with Applications in Energy-Efficient Timetabling," Operations Research Proceedings, in: Bernard Fortz & Martine Labbé (ed.), Operations Research Proceedings 2018, pages 3-9, Springer.
    • Handle: RePEc:spr:oprchp:978-3-030-18500-8_1
    DOI: 10.1007/978-3-030-18500-8_1
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:oprchp:978-3-030-18500-8_1. 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.