Solving mirrored traveling tournament problem benchmark instances with eight teams (Q924643): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disopt.2007.11.003
+Normal rank
@@ Property / OpenAlex ID @@
+W2008488464
@@ Property / OpenAlex ID: W2008488464 / rank @@
+Normal rank
@@ Property / cites work @@
+A simulated annealing approach to the traveling tournament problem
+Normal rank
@@ Property / cites work @@
+There are 526,915,620 nonisomorphic one‐factorizations of K<sub>12</sub>
+Normal rank
@@ Property / cites work @@
+Q4475665
@@ Property / cites work: Q4475665 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4075506
@@ Property / cites work: Q4075506 / rank @@
+Normal rank
@@ Property / cites work @@
+Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
+Normal rank
@@ Property / cites work @@
+A simulated annealing and hill-climbing algorithm for the traveling tournament problem
+Normal rank
@@ Property / cites work @@
+Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
+Normal rank
@@ Property / cites work @@
+A Benders approach for the constrained minimum break problem
+Normal rank
@@ Property / cites work @@
+Heuristics for the mirrored traveling tournament problem
+Normal rank
@@ Property / cites work @@
+Maximizing breaks and bounding solutions to the mirrored traveling tournament problem
+Normal rank