Sports scheduling and other topics in sports analytics: a survey with special reference to Latin America

G Durán - Top, 2021 - Springer
Recent years have witnessed vigorous development in the application of mathematical and
computational techniques to many aspects of the organization and planning of sports …

A new branch-and-price-and-cut algorithm for one-dimensional bin-packing problems

L Wei, Z Luo, R Baldacci, A Lim - INFORMS Journal on …, 2020 - pubsonline.informs.org
In this paper, a new branch-and-price-and-cut algorithm is proposed to solve the one-
dimensional bin-packing problem (1D-BPP). The 1D-BPP is one of the most fundamental …

Branch-and-price-and-cut for the synchronized vehicle routing problem with split delivery, proportional service time and multiple time windows

J Li, H Qin, R Baldacci, W Zhu - Transportation Research Part E: Logistics …, 2020 - Elsevier
This study addresses a vehicle routing problem (VRP) in which demands are discrete, split
delivery is allowed, service time is proportional to the units of delivered products, multiple …

The sport teams grou** problem

TAM Toffolo, J Christiaens, FCR Spieksma… - Annals of Operations …, 2019 - Springer
The sport teams grou** problem (STGP) concerns the assignment of sport teams to round-
robin tournaments. The objective is to minimize the total travel distance of the participating …

Branch-and-bound with decomposition-based lower bounds for the traveling umpire problem

TAM Toffolo, T Wauters, S Van Malderen… - European Journal of …, 2016 - Elsevier
Abstract The Traveling Umpire Problem (TUP) is an optimization problem in which umpires
have to be assigned to games in a double round robin tournament. The objective is to obtain …

An image-based approach to detecting structural similarity among mixed integer programs

Z Steever, C Murray, J Yuan… - INFORMS Journal …, 2022 - pubsonline.informs.org
Operations researchers have long drawn insight from the structure of constraint coefficient
matrices (CCMs) for mixed integer programs (MIPs). We propose a new question: Can …

Lower bounds for large traveling umpire instances: new valid inequalities and a branch-and-cut algorithm

L de Oliveira, CC de Souza, T Yunes - Computers & Operations Research, 2016 - Elsevier
Given a double round-robin tournament, the Traveling Umpire Problem (TUP) seeks to
assign umpires to the games of the tournament while minimizing the total distance traveled …

An exact algorithm for the multi-period inspector scheduling problem

H Shen, S Shu, H Qin, Q Wu - Computers & Industrial Engineering, 2020 - Elsevier
In this paper, we study the multi-period inspector scheduling problem (MPISP). This problem
aims to determine a set of routes for a team of inspectors performing inspection jobs in …

Analysis of a constructive matheuristic for the traveling umpire problem

RC Chandrasekharan, TAM Toffolo… - Journal of Quantitative …, 2019 - degruyter.com
Abstract The Traveling Umpire Problem (TUP) is a combinatorial optimization problem
concerning the assignment of umpires to the games of a fixed double round-robin …

Variable neighborhood search for major league baseball scheduling problem

YC Liang, YY Lin, AHL Chen, WS Chen - Sustainability, 2021 - mdpi.com
Modern society pays more and more attention to leisure activities, and watching sports is
one of the most popular activities for people. In professional leagues, sports scheduling …