A Lagrangian approach for minimum cost single round robin tournaments

DOI10.1016/j.cor.2011.05.018zbMath1251.90275OpenAlexW2126759527MaRDI QIDQ1762030

Dirk Briskorn, Andrei Horbach

Publication date: 15 November 2012

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2011.05.018

zbMATH Keywords

Lagrangian approachsports league schedulinground robin tournamentsstadium availability

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items

A traditional Benders' approach to sports timetabling

Uses Software

• Blossom IV

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Round robin tournaments and three index assignments
• Scheduling in sports: an annotated bibliography
• A Benders approach for the constrained minimum break problem
• IP models for round robin tournaments
• Combinatorial properties of strength groups in round robin tournaments
• A branching scheme for finding cost-minimal round robin tournaments
• Minimizing costs in round robin tournaments with place constraints
• Some models of graphs for scheduling sports competitions
• Geography, games and graphs
• Minimizing irregularities in sports schedules using graph theory
• Combinatorial aspects of construction of competition Dutch professional football leagues
• Global constraints for round robin tournament scheduling.
• Accelerating the convergence of subgradient optimisation
• Round robin scheduling -- a survey
• Construction of sports schedules with multiple venues
• Scheduling the professional soccer leagues of Austria and Germany
• A branch-and-price algorithm for scheduling sport leagues
• Complex Scheduling
• Scheduling a Major College Basketball Conference—Revisited
• On the multiplication of divisions: The use of graphs for sports scheduling
• Constructing timetables for sport competitions
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Scheduling in Sports
• An algorithm for finding factorizations of complete graphs
• Computing Minimum-Weight Perfect Matchings
• Validation of subgradient optimization
• Alternative IP Models for Sport Leagues Scheduling
• Maximum matching and a polyhedron with 0,1-vertices

This page was built for publication: A Lagrangian approach for minimum cost single round robin tournaments