The stable tournament problem: matching sports schedules with preferences

DOI10.1016/J.ORL.2017.07.004zbMath1409.90086OpenAlexW2740594028MaRDI QIDQ1728308

Mario Guajardo, Kurt O. Jørnsten

Publication date: 22 February 2019

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2017.07.004

zbMATH Keywords

integer programmingpreferencesstable matchingsports scheduling

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Matching models (91B68)

Related Items (2)

Sports scheduling and other topics in sports analytics: a survey with special reference to Latin America ⋮ Integer programming methods to identify Nash equilibrium solutions for platform-based scheduling games

Cites Work

• Unnamed Item
• Near-optimal MIP solutions for preference based self-scheduling
• Preference-based assignment of university students to multiple teaching groups
• Linear programming brings marital bliss
• Hard variants of stable marriage.
• The stable fixtures problem -- a many-to-many extension of stable roommates
• Round robin scheduling -- a survey
• On a generalization of the stable roommates problem
• An efficient algorithm for the “stable roommates” problem
• College Admissions and the Stability of Marriage

This page was built for publication: The stable tournament problem: matching sports schedules with preferences