An effective greedy heuristic for the social golfer problem

DOI10.1007/s10479-011-0866-7zbMath1251.90193OpenAlexW2133025937MaRDI QIDQ1761919

Nysret Musliu, Markus Triska

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-011-0866-7

zbMATH Keywords

combinatorial optimizationfinite geometrysports schedulingdesign theory

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (4)

A greedy algorithm for the social golfer and the Oberwolfach problem ⋮ Partitioning students into cohorts during COVID-19 ⋮ The traveling social golfer problem: the case of the Volleyball Nations League ⋮ Scheduling reach mahjong tournaments using pseudoboolean constraints

Uses Software

• nauty
• CSPLib

Cites Work

• The complexity of completing partial Latin squares
• Universal hashing and authentication codes
• An improved SAT formulation for the social golfer problem
• Solving Kirkman's schoolgirl problem in a few seconds
• Solving the MOLR and Social Golfers Problems
• New constructions for covering designs
• Scheduling Social Golfers Locally
• Orthogonal Latin Square Codes
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An effective greedy heuristic for the social golfer problem