Pages that link to "Item:Q1294044"

The following pages link to Scheduling sport tournaments using constraint logic programming (Q1294044):

Displaying 14 items.

• The timetable constrained distance minimization problem (Q846138) (← links)
• A Benders approach for the constrained minimum break problem (Q856212) (← links)
• Global constraints for round robin tournament scheduling. (Q1417492) (← links)
• Memetic algorithm timetabling for non-commercial sport leagues. (Q1417496) (← links)
• The stable tournament problem: matching sports schedules with preferences (Q1728308) (← links)
• Scheduling double round-robin tournaments with divisional play using constraint programming (Q1751946) (← links)
• A linear-time algorithm to solve the sports league scheduling problem (prob026 of CSPLib) (Q1887059) (← links)
• Scheduling a round robin tennis tournament under courts and players availability constraints (Q1960328) (← links)
• \textsc{Conjure}: automatic generation of constraint models from problem specifications (Q2163883) (← links)
• Compiling problem specifications into SAT (Q2457689) (← links)
• Round robin scheduling -- a survey (Q2475809) (← links)
• A constraint programming approach to the multiple-venue, sport-scheduling problem (Q2583769) (← links)
• Scheduling the professional soccer leagues of Austria and Germany (Q2583771) (← links)
• Model Transformation and Optimization of the Olympics Scheduling Problem (Q3500483) (← links)