IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v194y2012i1p427-43810.1007-s10479-010-0702-5.html
   My bibliography  Save this article

An improved SAT formulation for the social golfer problem

Author

Listed:
  • Markus Triska
  • Nysret Musliu

Abstract

The Social Golfer Problem (SGP) is a sports scheduling problem that exhibits a lot of symmetry and has recently attracted significant attention. In this paper, we first revisit an existing SAT encoding for the SGP and correct some of its clauses. We then propose a change in the encoding that significantly reduces the number of variables for all instances. We achieve considerable performance improvements when solving many SGP instances with common SAT solvers using local search and complete backtracking. This makes SAT formulations a more promising approach for solving the SGP than previously. Copyright Springer Science+Business Media, LLC 2012

Suggested Citation

  • Markus Triska & Nysret Musliu, 2012. "An improved SAT formulation for the social golfer problem," Annals of Operations Research, Springer, vol. 194(1), pages 427-438, April.
    • Handle: RePEc:spr:annopr:v:194:y:2012:i:1:p:427-438:10.1007/s10479-010-0702-5
    DOI: 10.1007/s10479-010-0702-5
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-010-0702-5
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-010-0702-5?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. Martin Mariusz Lester, 2022. "Pseudo-Boolean optimisation for RobinX sports timetabling," Journal of Scheduling, Springer, vol. 25(3), pages 287-299, June.
    2. Schmand, Daniel & Schröder, Marc & Vargas Koch, Laura, 2022. "A greedy algorithm for the social golfer and the Oberwolfach problem," European Journal of Operational Research, Elsevier, vol. 300(1), pages 310-319.
    3. Frédéric Lardeux & Eric Monfroy & Broderick Crawford & Ricardo Soto, 2015. "Set constraint model and automated encoding into SAT: application to the social golfer problem," Annals of Operations Research, Springer, vol. 235(1), pages 423-452, December.

    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:194:y:2012:i:1:p:427-438:10.1007/s10479-010-0702-5. 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.