Scheduling Social Golfers Locally
From MaRDI portal
Publication:5450929
DOI10.1007/11493853_13zbMath1133.90336OpenAlexW1534016862MaRDI QIDQ5450929
Pascal Van Hentenryck, Ivan Dotu
Publication date: 17 March 2008
Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11493853_13
Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (9)
Contraint-based combinators for local search ⋮ A greedy algorithm for the social golfer and the Oberwolfach problem ⋮ A constraint-based local search backend for MiniZinc ⋮ LocalSolver 1.x: A black-box local-search solver for 0-1 programming ⋮ An effective greedy heuristic for the social golfer problem ⋮ An improved SAT formulation for the social golfer problem ⋮ Revisiting constraint-directed search ⋮ The traveling social golfer problem: the case of the Volleyball Nations League ⋮ Scheduling reach mahjong tournaments using pseudoboolean constraints
This page was built for publication: Scheduling Social Golfers Locally
