The sport teams grouping problem
type: Item
instance of: scholarly article
title: The sport teams grouping problem
zbMATH Open document ID: 1411.90302
author: Túlio A. M. Toffolo
author: Jan Christiaens
author: Frits C. R. Spieksma
author: Greet Vanden Berghe
published in: Annals of Operations Research
publication date: 2019-03-06T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7032715
zbMATH Keywords: sport teams grouping problem
zbMATH Keywords: branch-and-price
zbMATH Keywords: column generation
zbMATH Keywords: decomposition strategies
zbMATH Keywords: integer programming
zbMATH Keywords: meta-heuristic
MaRDI profile type: Publication
OpenAlex ID: W2740739372
cites work: Branching rules revisited
cites work: Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables
cites work: A simulated annealing approach to the traveling tournament problem
cites work: Branch-and-price: Column generation for solving huge integer programs
cites work: Round robin tournaments and three index assignments
cites work: Decomposition Principle for Linear Programs
cites work: Q4475665
cites work: Edge coloring: a natural model for sports scheduling
cites work: Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement
cites work: Scheduling in sports: an annotated bibliography
cites work: Scheduling non-professional table-tennis leagues
cites work: Size-constrained graph partitioning polytopes
cites work: Selected Topics in Column Generation
cites work: Cliques and clustering: A combinatorial approach
cites work: Sports scheduling: Problems and applications
cites work: Memetic algorithm timetabling for non-commercial sport leagues.
cites work: New facets and a branch-and-cut algorithm for the weighted clique problem.
cites work: Branch-and-bound with decomposition-based lower bounds for the traveling umpire problem
cites work: Bender’s Cuts Guided Large Neighborhood Search for the Traveling Umpire Problem
cites work: Benders' cuts guided large neighborhood search for the traveling umpire problem
cites work: Two exact algorithms for the traveling umpire problem
DOI: 10.1007/S10479-017-2595-Z
description: scientific article; zbMATH DE number 7032715