{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T10:47:04Z","timestamp":1775040424811,"version":"3.50.1"},"reference-count":28,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2025,3,1]]},"DOI":"10.1587\/transinf.2024fcp0003","type":"journal-article","created":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T22:10:59Z","timestamp":1723068659000},"page":"192-200","source":"Crossref","is-referenced-by-count":1,"title":["A Bigram Based ILP Formulation for Break Minimization in Sports Scheduling Problems"],"prefix":"10.1587","volume":"E108.D","author":[{"given":"Koichi","family":"FUJII","sequence":"first","affiliation":[{"name":"Department of Industrial Engineering and Economics at Tokyo Institute Technology University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomomi","family":"MATSUI","sequence":"additional","affiliation":[{"name":"Department of Industrial Engineering and Economics at Tokyo Institute Technology University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] G.L. Nemhauser and M.A. Trick, \u201cScheduling a major college basketball conference,\u201d Operations Research, vol.46, no.1, pp.1-8, 1998. 10.1287\/opre.46.1.1","DOI":"10.1287\/opre.46.1.1"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] D. Briskorn, \u201cFeasibility of home-away-pattern sets for round robin tournaments,\u201d Operations Research Letters, vol.36, no.3, pp.283-284, 2008. 10.1016\/j.orl.2007.09.009","DOI":"10.1016\/j.orl.2007.09.009"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] R. Miyashiro, H. Iwasaki, and T. Matsui, \u201cCharacterizing feasible pattern sets with a minimum number of breaks,\u201d PATAT 2002, Lecture Notes in Computer Science, vol.2740, pp.78-99, Springer, 2002. 10.1007\/978-3-540-45157-0_5","DOI":"10.1007\/978-3-540-45157-0_5"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] M. Henz, \u201cScheduling a major college basketball conference\u2014revisited,\u201d Operations Research, vol.49, no.1, pp.163-168, 2001. 10.1287\/opre.49.1.163.11193","DOI":"10.1287\/opre.49.1.163.11193"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] D. Van Bulck and D. Goossens, \u201cOptimizing rest times and differences in games played: an iterative two-phase approach,\u201d Journal of Scheduling, vol.25, no.3, pp.261-271, 2022. 10.1007\/s10951-021-00717-3","DOI":"10.1007\/s10951-021-00717-3"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] L. Zeng and S. Mizuno, \u201cOn the separation in 2-period double round robin tournaments with minimum breaks,\u201d Computers & Operations Research, vol.39, no.7, pp.1692-1700, 2012. 10.1016\/j.cor.2011.10.004","DOI":"10.1016\/j.cor.2011.10.004"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] D. Van Bulck and D. Goossens, \u201cOn the complexity of pattern feasibility problems in time-relaxed sports timetabling,\u201d Operations Research Letters, vol.48, no.4, pp.452-459, 2020. 10.1016\/j.orl.2020.05.005","DOI":"10.1016\/j.orl.2020.05.005"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] M.A. Trick, \u201cA schedule-then-break approach to sports timetabling,\u201d PATAT 2000, Lecture Notes in Computer Science, vol.2079, pp.242-253, Springer, 2000. 10.1007\/3-540-44629-x_15","DOI":"10.1007\/3-540-44629-X_15"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] R. Miyashiro and T. Matsui, \u201cA polynomial-time algorithm to find an equitable home-away assignment,\u201d Operations Research Letters, vol.33, no.3, pp.235-241, 2005. 10.1016\/j.orl.2004.06.004","DOI":"10.1016\/j.orl.2004.06.004"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] R. Miyashiro and T. Matsui, \u201cSemidefinite programming based approaches to the break minimization problem,\u201d Computers & Operations Research, vol.33, no.7, pp.1975-1982, 2006. 10.1016\/j.cor.2004.09.030","DOI":"10.1016\/j.cor.2004.09.030"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] G. Post and G.J. Woeginger, \u201cSports tournaments, home-away assignments, and the break minimization problem,\u201d Discrete Optimization, vol.3, no.2, pp.165-173, 2006. 10.1016\/j.disopt.2005.08.009","DOI":"10.1016\/j.disopt.2005.08.009"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] R.V. Rasmussen and M.A. Trick, \u201cThe timetable constrained distance minimization problem,\u201d CPAIOR 2006, Lecture Notes in Computer Science, vol.3990, pp.167-181, Springer, 2006. 10.1007\/11757375_15","DOI":"10.1007\/11757375_15"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] R.V. Rasmussen, \u201cScheduling a triple round robin tournament for the best danish soccer league,\u201d European Journal of Operational Research, vol.185, no.2, pp.795-810, 2008. 10.1016\/j.ejor.2006.12.050","DOI":"10.1016\/j.ejor.2006.12.050"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] T. Achterberg and R. Wunderling, \u201cMixed integer programming: Analyzing 12 years of progress,\u201d Facets of combinatorial optimization: Festschrift for Martin Gr\u00f6tschel, pp.449-481, Springer, 2013. 10.1007\/978-3-642-38189-8_18","DOI":"10.1007\/978-3-642-38189-8_18"},{"key":"15","doi-asserted-by":"publisher","unstructured":"[15] T. Koch, T. Berthold, J. Pedersen, and C. Vanaret, \u201cProgress in mathematical programming solvers from 2001 to 2020,\u201d EURO Journal on Computational Optimization, vol.10, p.100031, 2022. 10.1016\/j.ejco.2022.100031","DOI":"10.1016\/j.ejco.2022.100031"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] D. de Werra, \u201cScheduling in sports,\u201d Studies on Graphs and Discrete Programming, vol.59, pp.381-395, 1981. 10.1016\/s0304-0208(08)73478-9","DOI":"10.1016\/S0304-0208(08)73478-9"},{"key":"17","doi-asserted-by":"publisher","unstructured":"[17] M. Elf, M. J\u00fcnger, and G. Rinaldi, \u201cMinimizing breaks by maximizing cuts,\u201d Operations Research Letters, vol.31, no.5, pp.343-349, 2003. 10.1016\/s0167-6377(03)00025-7","DOI":"10.1016\/S0167-6377(03)00025-7"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] J.-C. R\u00e9gin, \u201cMinimization of the number of breaks in sports scheduling problems using constraint programming,\u201d DIMACS workshop on Constraint Programming and Large Scale Discrete Optimization, pp.115-130, 2000.","DOI":"10.1090\/dimacs\/057\/07"},{"key":"19","unstructured":"[19] P. Van Hentenryck and Y. Vergados, \u201cMinimizing breaks in sport scheduling with local search,\u201d ICAPS, pp.22-29, 2005."},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] M.X. Goemans and D.P. Williamson, \u201cImproved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming,\u201d Journal of the ACM, vol.42, no.6, pp.1115-1145, 1995. 10.1145\/227683.227684","DOI":"10.1145\/227683.227684"},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] J.C. Peng, A.D. Clark, and A. Dahbura, \u201cIntroducing human corrective multi-team SRR sports scheduling via reinforcement learning,\u201d 2021 IEEE Symposium Series on Computational Intelligence (SSCI), pp.1-7, IEEE, 2021. 10.1109\/ssci50451.2021.9660171","DOI":"10.1109\/SSCI50451.2021.9660171"},{"key":"22","doi-asserted-by":"publisher","unstructured":"[22] M. Kuramata, R. Katsuki, and K. Nakata, \u201cSolving large break minimization problems in a mirrored double round-robin tournament using quantum annealing,\u201d Plos one, vol.17, no.4, p.e0266846, 2022. 10.1371\/journal.pone.0266846","DOI":"10.1371\/journal.pone.0266846"},{"key":"23","doi-asserted-by":"publisher","unstructured":"[23] K. Bestuzheva, M. Besan\u00e7on, W.-K. Chen, A. Chmiela, T. Donkiewicz, J. van Doornmalen, L. Eifler, O. Gaul, G. Gamrath, A. Gleixner, L. Gottwald, C. Graczyk, K. Halbig, A. Hoen, C. Hojny, R. van der Hulst, T. Koch, M. L\u00fcbbecke, S.J. Maher, F. Matter, E. M\u00fchmer, B. M\u00fcller, M.E. Pfetsch, D. Rehfeldt, S. Schlein, F. Schl\u00f6sser, F. Serrano, Y. Shinano, B. Sofranac, M. Turner, S. Vigerske, F. Wegscheider, P. Wellner, D. Weninger, and J. Witzig, \u201cEnabling research through the SCIP optimization suite 8.0,\u201d ACM Transactions on Mathematical Software, vol.49, no.2, pp.1-21, 2023. 10.1145\/3585516","DOI":"10.1145\/3585516"},{"key":"24","doi-asserted-by":"publisher","unstructured":"[24] D. Van Bulck, D. Goossens, J. Sch\u00f6nberger, and M. Guajardo, \u201cRobinX: A three-field classification and unified data format for round-robin sports timetabling,\u201d European Journal of Operational Research, vol.280, no.2, pp.568-580, 2020. 10.1016\/j.ejor.2019.07.023","DOI":"10.1016\/j.ejor.2019.07.023"},{"key":"25","doi-asserted-by":"crossref","unstructured":"[25] K. Easton, G. Nemhauser, and M. Trick, \u201cSolving the travelling tournament problem: A combined integer programming and constraint programming approach,\u201d PATAT 2002, Lecture Notes in Computer Science, vol.2740, Springer, pp.100-109, 2002. 10.1007\/978-3-540-45157-0_6","DOI":"10.1007\/978-3-540-45157-0_6"},{"key":"26","doi-asserted-by":"crossref","unstructured":"[26] H.L. Urdaneta, J. Yuan, and A.S. Siqueira, \u201cAlternative integer linear and quadratic programming formulations for HA-Assignment problems,\u201d Proceeding Series of the Brazilian Society of Computational and Applied Mathematics, vol.6, no.1, 2018. 10.5540\/03.2018.006.01.0311","DOI":"10.5540\/03.2018.006.01.0311"},{"key":"27","doi-asserted-by":"publisher","unstructured":"[27] S. Vigerske and A. Gleixner, \u201cScip: Global optimization of mixed-integer nonlinear programs in a branch-and-cut framework,\u201d Optimization Methods and Software, vol.33, no.3, pp.563-593, 2018. 10.1080\/10556788.2017.1335312","DOI":"10.1080\/10556788.2017.1335312"},{"key":"28","doi-asserted-by":"publisher","unstructured":"[28] D. Rehfeldt, T. Koch, and Y. Shinano, \u201cFaster exact solution of sparse MaxCut and QUBO problems,\u201d Mathematical Programming Computation, vol.15, no.3, pp.445-470, 2023. 10.1007\/s12532-023-00236-6","DOI":"10.1007\/s12532-023-00236-6"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E108.D\/3\/E108.D_2024FCP0003\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T03:33:31Z","timestamp":1740800011000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E108.D\/3\/E108.D_2024FCP0003\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,1]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2024fcp0003","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,1]]},"article-number":"2024FCP0003"}}