Sports scheduling search space connectivity: a riffle shuffle driven approach

DOI10.1016/J.DAM.2016.04.018MaRDI QIDQ335339zbMATHOpenAlexDBLPWikidataFDO

Authors Tiago Januario, Sebastián Urrutia, Dominique De Werra

Publication date 2 November 2016

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2016.04.018

zbMATH Keywords

sport schedulingcanonical methodriffle shuffle

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Deterministic scheduling theory in operations research (90B35)

Recommendations

• A new neighborhood structure for round robin scheduling problems
• Round robin scheduling -- a survey
• On the organization of round robin tournaments with constraints
• IP models for round robin tournaments
• Round robin tournaments and three index assignments

Cites work

• scientific article; zbMATH DE number 1808170 (Why is no real title available?)
• scientific article; zbMATH DE number 2001186 (Why is no real title available?)
• scientific article; zbMATH DE number 953298 (Why is no real title available?)
• scientific article; zbMATH DE number 3443655 (Why is no real title available?)
• A simulated annealing approach to the traveling tournament problem
• Heuristics for the mirrored traveling tournament problem
• Scheduling in Sports
• The generalized faro shuffle
• The mathematics of perfect shuffles

Cited in

(2)

• Recoloring subgraphs of \(K_{2n}\) for sports scheduling
• A new neighborhood structure for round robin scheduling problems

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Sports scheduling search space connectivity: a riffle shuffle driven approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q335339)