Sports scheduling search space connectivity: a riffle shuffle driven approach

DOI10.1016/J.DAM.2016.04.018zbMATH Open1348.05204DBLPjournals/dam/JanuarioUW16OpenAlexW2364745966WikidataQ60692139 ScholiaQ60692139MaRDI QIDQ335339FDOQ335339

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

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

zbMATH Keywords

sport schedulingcanonical methodriffle shuffle

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Scheduling in Sports
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

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

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)