Break Minimization Problem for U12 Basketball League

DOI

Bibliographic Information

Other Title
  • U12バスケットボールリーグ戦におけるブレーク数最小化問題

Abstract

<p>Break minimization problem is one of the representative problems in sport scheduling. The aim of this problem is to find a home-away assignment that minimizes the number of breaks, that is, the number of occurrences of consecutive games held either both at away or both at home for a team. In this paper, Break Minimization Problem of U12 basketball league games (BMPU12) is first introduced. In the experiments, we utilize the real data of U12 basketball league games played in Hyogo prefecture in 2018 and find the minimal number of breaks for it.</p>

Journal

Keywords

Details 詳細情報について

  • CRID
    1390566775142824192
  • NII Article ID
    130007856947
  • DOI
    10.11517/pjsai.jsai2020.0_2n6gs102
  • Text Lang
    ja
  • Data Source
    • JaLC
    • CiNii Articles
  • Abstract License Flag
    Disallowed

Report a problem

Back to top