中文
相关论文

相关论文: Scheduling Bipartite Tournaments to Minimize Total…

200 篇论文

The bipartite traveling tournament problem (BTTP) addresses inter-league sports scheduling, which aims to design a feasible bipartite tournament between two $n$-team leagues under some constraints such that the total traveling distance of…

数据结构与算法 · 计算机科学 2025-05-13 Jingyang Zhao , Mingyu Xiao

The Traveling Tournament Problem(TTP) is a combinatorial optimization problem where we have to give a scheduling algorithm which minimizes the total distance traveled by all the participating teams of a double round-robin tournament…

数据结构与算法 · 计算机科学 2021-09-21 Diptendu Chatterjee , Bimal Kumar Roy

In some domestic professional sports leagues, the home stadiums are located in cities connected by a common train line running in one direction. For these instances, we can incorporate this geographical information to determine optimal or…

人工智能 · 计算机科学 2014-01-24 Richard Hoshino , Ken-ichi Kawarabayashi

The Traveling Tournament Problem (TTP) is a hard but interesting sports scheduling problem inspired by Major League Baseball, which is to design a double round-robin schedule such that each pair of teams plays one game in each other's home…

数据结构与算法 · 计算机科学 2022-12-26 Jingyang Zhao , Mingyu Xiao

The Traveling Tournament Problem (TTP) is a hard but interesting sports scheduling problem inspired by Major League Baseball, which is to design a double round-robin schedule such that each pair of teams plays one game in each other's home…

数据结构与算法 · 计算机科学 2021-08-31 Jingyang Zhao , Mingyu Xiao

We present a new problem called the incomplete Traveling Tournament problem, which introduces the well known Traveling Tournament Problem into the realm of incomplete round-robin tournaments. We focus on the case where teams can face each…

最优化与控制 · 数学 2026-03-23 Karel Devriesere , David Van Bulck , Dries Goossens

The Traveling Tournament Problem (TTP) is a challenging combinatorial optimization problem that has attracted the interest of researchers around the world. This paper proposes an improved search neighbourhood for the TTP that has been…

数据结构与算法 · 计算机科学 2010-07-06 Glenn Langford

We study the so-called the traveling tournament problem (TTP), to find an optimal tournament schedule. Differently from the original TTP, in which the total travel distance of all the participants is the objective function to minimize, we…

物理与社会 · 物理学 2012-08-13 Hyang Min Jeong , Sang-Woo Kim , Aaram J. Kim , Younguk Choi , Jonghyoun Eun , Beom Jun Kim

A sport tournament problem is considered the Traveling Tournament Problem (TTP). One interesting type is the mirrored Traveling Tournament Problem (mTTP). The objective of the problem is to minimize either the total number of traveling or…

神经与进化计算 · 计算机科学 2017-04-18 Tinnaluk Rutjanisarakul , Thiradet Jiarasuksakun

The Traveling Tournament Problem (TTP) is a well-known benchmark problem in the field of tournament timetabling, which asks us to design a double round-robin schedule such that each pair of teams plays one game in each other's home venue,…

数据结构与算法 · 计算机科学 2024-04-18 Jingyang Zhao , Mingyu Xiao , Chao Xu

The Traveling Tournament Problem (TTP-$k$) is a well-known benchmark problem in tournament timetabling, which asks us to design a double round-robin schedule such that the total traveling distance of all $n$ teams is minimized under the…

数据结构与算法 · 计算机科学 2023-09-06 Jingyang Zhao , Mingyu Xiao

The Traveling Tournament Problem is a sports-scheduling problem where the goal is to minimize the total travel distance of teams playing a double round-robin tournament. The constraint 'k' is an imposed upper bound on the number of…

计算复杂性 · 计算机科学 2021-10-07 Diptendu Chatterjee

The Traveling Tournament Problem (TTP) is a benchmark problem in sports scheduling and has been extensively studied in recent years. The Mirrored Traveling Tournament Problem (mTTP) is variation of the TTP that represents certain types of…

分布式、并行与集群计算 · 计算机科学 2013-11-12 Vijay Menon , Saurabh Jha

The Traveling Tournament Problem (TTP-$k$) is a well-known benchmark problem in sports scheduling, which asks us to design a double round-robin schedule such that each pair of teams plays one game in each other's home venue, no pair of…

数据结构与算法 · 计算机科学 2025-05-29 Jingyang Zhao , Mingyu Xiao

The traveling tournament problem (TTP) is to minimize the total traveling distance of all teams in a double round-robin tournament. In this paper, we focus on TTP-2, in which each team plays at most two consecutive home games and at most…

数据结构与算法 · 计算机科学 2024-03-01 Yuga Kanaya , Kenjiro Takazawa

The traveling tournament problem is a well-known benchmark problem of the sports scheduling. We propose an approximation algorithm for the traveling tournament problem with the constraints such that both the number of consecutive home games…

数据结构与算法 · 计算机科学 2021-08-20 Shinji Imahori

Scheduling a sports tournament is a complex optimization problem, which requires a large number of hard constraints to satisfy. Despite the availability of several such constraints in the literature, there remains a gap since most of the…

The National Basketball Association (NBA) is actively considering the addition of two expansion teams, raising the question of how to restructure its conferences and divisions to balance travel efficiency, fairness, and revenue…

物理与社会 · 物理学 2025-12-22 Ali Hassanzadeh , Morteza Davari , Dries Goossens

Constructing a suitable schedule for sports competitions is a crucial issue in sports scheduling. The round-robin tournament is a competition adopted in many professional sports. For most round-robin tournaments, it is considered…

离散数学 · 计算机科学 2024-11-26 Koichi Fujii , Tomomi Matsui

Sports leagues consist of conferences subdivided into divisions. Teams play a number of games within their divisions and fewer games against teams in different divisions and conferences. Usually, a league structure remains stable from one…

应用统计 · 统计学 2013-02-20 Brian Macdonald , William Pulleyblank
‹ 上一页 1 2 3 10 下一页 ›