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

Quantified Combinatorial Optimization

In: Operations Research Proceedings 2013

Author

Listed:
  • Thorsten Ederer

    (TU Darmstadt)

  • Ulf Lorenz

    (TU Darmstadt)

  • Thomas Opfer

    (TU Darmstadt)

Abstract

MIP and IP programming are state-of-the-art modeling techniques for computer-aided optimization. However, companies observe an increasing danger of disruptions that prevent them from acting as planned. One reason is input data being assumed as deterministic, but in reality, data is afflicted with uncertainties. Incorporating uncertainty in existing models, however, often pushes the complexity of problems that are in P or NP, to the complexity class PSPACE. Quantified integer linear programming (QIP) is a PSPACE-complete extension of the IP problem with variables being either existentially or universally quantified. With the help of QIPs, it is possible to model board-games like Gomoku as well as traditional combinatorial OR problems under uncertainty. In this paper, we present how to extend the model formulation of classical scheduling problems like the Job-Shop and Car-Sequencing problem by uncertain influences and give illustrating examples with solutions.

Suggested Citation

  • Thorsten Ederer & Ulf Lorenz & Thomas Opfer, 2014. "Quantified Combinatorial Optimization," Operations Research Proceedings, in: Dennis Huisman & Ilse Louwerse & Albert P.M. Wagelmans (ed.), Operations Research Proceedings 2013, edition 127, pages 121-128, Springer.
    • Handle: RePEc:spr:oprchp:978-3-319-07001-8_17
    DOI: 10.1007/978-3-319-07001-8_17
    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-319-07001-8_17. 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.