Scheduling Social Golfers Locally

DOI10.1007/11493853_13MaRDI QIDQ5450929zbMATH OpenOpenAlexFDO

Authors Ivan Dotu, Pascal Van Hentenryck

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

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Recommendations

• Scheduling social tournaments locally
• An Attempt to Dynamically Break Symmetries in the Social Golfers Problem
• An effective greedy heuristic for the social golfer problem
• An improved SAT formulation for the social golfer problem
• Solving the MOLR and Social Golfers Problems

Cited in

(12)

• Revisiting constraint-directed search
• An effective greedy heuristic for the social golfer problem
• An improved SAT formulation for the social golfer problem
• The traveling social golfer problem: the case of the Volleyball Nations League
• Scheduling reach mahjong tournaments using pseudoboolean constraints
• A greedy algorithm for the social golfer and the Oberwolfach problem
• Solving the MOLR and Social Golfers Problems
• An Attempt to Dynamically Break Symmetries in the Social Golfers Problem
• Scheduling social tournaments locally
• LocalSolver 1.x: A black-box local-search solver for 0-1 programming
• Contraint-based combinators for local search
• A constraint-based local search backend for MiniZinc

This page was built for publication: Scheduling Social Golfers Locally

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5450929)