Scheduling sport tournaments using constraint logic programming
From MaRDI portal
Publication:1294044
DOI10.1023/A:1009845710839zbMATH Open0949.90045MaRDI QIDQ1294044FDOQ1294044
Publication date: 29 June 1999
Published in: Constraints (Search for Journal in Brave)
Recommendations
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
Cited In (14)
- Round robin scheduling -- a survey
- Compiling problem specifications into SAT
- A constraint programming approach to the multiple-venue, sport-scheduling problem
- Scheduling the professional soccer leagues of Austria and Germany
- A linear-time algorithm to solve the sports league scheduling problem (prob026 of CSPLib)
- The timetable constrained distance minimization problem
- Model Transformation and Optimization of the Olympics Scheduling Problem
- Memetic algorithm timetabling for non-commercial sport leagues.
- \textsc{Conjure}: automatic generation of constraint models from problem specifications
- Title not available (Why is that?)
- Global constraints for round robin tournament scheduling.
- A Benders approach for the constrained minimum break problem
- Scheduling double round-robin tournaments with divisional play using constraint programming
- Scheduling a round robin tennis tournament under courts and players availability constraints
This page was built for publication: Scheduling sport tournaments using constraint logic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1294044)
