Set constraint model and automated encoding into SAT: application to the social golfer problem

DOI10.1007/s10479-015-1914-5zbMath1332.90277arXiv1406.7196OpenAlexW1788757403MaRDI QIDQ256655

Broderick Crawford, Eric Monfroy, Frédéric Lardeux, Ricardo L. Soto

Publication date: 9 March 2016

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

Full work available at URL: https://arxiv.org/abs/1406.7196

zbMATH Keywords

set constraintsconstraint programmingcspSAT encodingsocial golfer problem

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Nonlinear programming (90C30)

Related Items (1)

Scheduling reach mahjong tournaments using pseudoboolean constraints

Uses Software

• MiniSat
• CSPLib
• Choco
• MiniZinc

Cites Work

• Unnamed Item
• Unnamed Item
• An improved SAT formulation for the social golfer problem
• Negative effects of modeling techniques on search performance
• GAC Via Unit Propagation
• An Attempt to Dynamically Break Symmetries in the Social Golfers Problem
• MiniZinc with Functions
• Improving Stochastic Local Search for SAT with a New Probability Distribution
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• Principles and Practice of Constraint Programming – CP 2003

This page was built for publication: Set constraint model and automated encoding into SAT: application to the social golfer problem