Scheduling sport tournaments using constraint logic programming

DOI10.1023/A:1009845710839zbMath0949.90045MaRDI QIDQ1294044

Andrea Schaerf

Publication date: 29 June 1999

Published in: Constraints (Search for Journal in Brave)

zbMATH Keywords

branch and boundlocal searchconstraint logic programmingsport schedulingscheduling applications

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items (11)

A linear-time algorithm to solve the sports league scheduling problem (prob026 of CSPLib) ⋮ The timetable constrained distance minimization problem ⋮ A Benders approach for the constrained minimum break problem ⋮ \textsc{Conjure}: automatic generation of constraint models from problem specifications ⋮ Global constraints for round robin tournament scheduling. ⋮ Memetic algorithm timetabling for non-commercial sport leagues. ⋮ Compiling problem specifications into SAT ⋮ Scheduling double round-robin tournaments with divisional play using constraint programming ⋮ Round robin scheduling -- a survey ⋮ A constraint programming approach to the multiple-venue, sport-scheduling problem ⋮ Scheduling the professional soccer leagues of Austria and Germany

This page was built for publication: Scheduling sport tournaments using constraint logic programming