An improved SAT formulation for the social golfer problem

DOI10.1007/S10479-010-0702-5zbMath1251.90194OpenAlexW2023331514MaRDI QIDQ1761920

Markus Triska, Nysret Musliu

Publication date: 15 November 2012

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-010-0702-5

zbMATH Keywords

combinatorial optimizationfinite geometrysports schedulingdesign theory

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (5)

A greedy algorithm for the social golfer and the Oberwolfach problem ⋮ An effective greedy heuristic for the social golfer problem ⋮ Multicriteria models for planning power-networking events ⋮ Set constraint model and automated encoding into SAT: application to the social golfer problem ⋮ Scheduling reach mahjong tournaments using pseudoboolean constraints

Uses Software

• CSPLib
• Walksat
• SATO
• DIMACS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of completing partial Latin squares
• Solving Kirkman's schoolgirl problem in a few seconds
• Propagation algorithms for lexicographic ordering constraints
• Solving the MOLR and Social Golfers Problems
• Scheduling Social Golfers Locally

This page was built for publication: An improved SAT formulation for the social golfer problem