Sports scheduling search space connectivity: a riffle shuffle driven approach

DOI10.1016/j.dam.2016.04.018zbMath1348.05204OpenAlexW2364745966WikidataQ60692139 ScholiaQ60692139MaRDI QIDQ335339

Sebastián Urrutia, Tiago Januario, 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

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

Related Items (1)

Recoloring subgraphs of \(K_{2n}\) for sports scheduling

Uses Software

• OEIS

Cites Work

• Heuristics for the mirrored traveling tournament problem
• A simulated annealing approach to the traveling tournament problem
• The mathematics of perfect shuffles
• The generalized faro shuffle
• Scheduling in Sports
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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