Constructing fair single round robin tournaments regarding strength groups with a minimum number of breaks (Q2450701): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.orl.2013.06.007
+Normal rank
@@ Property / OpenAlex ID @@
+W1976178837
@@ Property / OpenAlex ID: W1976178837 / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial properties of strength groups in round robin tournaments
+Normal rank
@@ Property / cites work @@
+IP models for round robin tournaments
@@ Property / cites work: IP models for round robin tournaments / rank @@
+Normal rank
@@ Property / cites work @@
+Constructing fair sports league schedules with regard to strength groups
+Normal rank
@@ Property / cites work @@
+Geography, games and graphs
@@ Property / cites work: Geography, games and graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling in Sports
@@ Property / cites work: Scheduling in Sports / rank @@
+Normal rank
@@ Property / cites work @@
+Some models of graphs for scheduling sports competitions
+Normal rank
@@ Property / cites work @@
+A polynomial-time algorithm to find an equitable home--away assignment
+Normal rank
@@ Property / cites work @@
+Round robin scheduling -- a survey
@@ Property / cites work: Round robin scheduling -- a survey / rank @@
+Normal rank
@@ Property / cites work @@
+Constructing fair round robin tournaments with a minimum number of breaks
+Normal rank