Feasibility of home-away-pattern sets for round robin tournaments
type: Item
instance of: scholarly article
title: Feasibility of home-away-pattern sets for round robin tournaments
zbMATH Open document ID: 1142.91364
author: Dirk Briskorn
published in: Operations Research Letters
publication date: 2008-09-10T00:00:00Z
Mathematics Subject Classification ID: 91A35
zbMATH DE Number: 5324073
zbMATH Keywords: round robin tournaments
zbMATH Keywords: home-away-pattern set feasibility problem
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: j.orl.2007.09.009
OpenAlex ID: W1972322518
cites work: Sports tournaments, home-away assignments, and the break minimization problem
DOI: 10.1016/J.ORL.2007.09.009
Recommended article: Scheduling partial round robin tournaments subject to home away pattern sets
Recommended article: Round-robin tournaments with homogeneous rounds
Recommended article: On the organization of round robin tournaments with constraints
Recommended article: Integer programming models for round Robin tournaments
Recommended article: Counting the number of round-robin tournament schedules
Recommended article: Maximising common fixtures in a round robin tournament with two divisions
Recommended article: Minimization of rest mismatches in round robin tournaments
Recommended article: Sports tournaments, home-away assignments, and the break minimization problem
Recommended article: Constructing fair round robin tournaments with a minimum number of breaks
Recommended article: Q5702323
description: scientific article; zbMATH DE number 5324073