Sports Leagues Scheduling: Models, Combinatorial Properties, and Optimization Algorithms

✍ Scribed by Dirk Briskorn (auth.)

Publisher: Springer-Verlag Berlin Heidelberg
Year: 2008
Tongue: English
Leaves: 170
Series: Lecture Notes in Economics and Mathematical Systems 603
Edition: 1
Category: Library

No coin nor oath required. For personal study only.

✦ Synopsis

In the context of sports leagues scheduling (SLS) several groups' interests must be taken into account. This book treats requirements for sport leagues schedules to be realizable from an operational and a security point of view, attractive for spectators and tv channels, and fair for the conampeting teams. Formal problem definitions as well as integer programming models are presented and analyzed. Additionally, several fairness concepts are developed and their operability is investigated by means of graph theory. Moreover, this book presents algorithmic concepts that can be drawn upon to construct suitable schedules. This volume provides a deep understanding of problems arising in the context of SLS as well as approaches for dealing with these problems, being relevant for both theoreticians and practitioners.

✦ Table of Contents

Front Matter....Pages I-XI
Introduction....Pages 1-4
Basic Problems....Pages 5-27
Real World Problems....Pages 29-57
Combinatorial Properties of Strength Groups....Pages 59-78
Home-Away-Pattern Based Branching Schemes....Pages 79-102
Branch—and—Price Algorithm....Pages 103-143
Conclusions and Outlook....Pages 145-146
Back Matter....Pages 147-164

✦ Subjects

Operations Research/Decision Theory; Optimization; Combinatorics; Operations Research, Mathematical Programming

📜 SIMILAR VOLUMES

Sports Leagues Scheduling: Models, Combi

📁 Sports Leagues Scheduling: Models, Combinatorial Properties, and Optimization Algorithms (Lecture Notes in Economics and Mathematical Systems, 603)

✍ Dirk Briskorn 📂 Library 📅 2008 🏛 Springer 🌐 English

<p><span>In the context of sports leagues scheduling (SLS) several groups' interests must be taken into account. This book treats requirements for sport leagues schedules to be realizable from an operational and a security point of view, attractive for spectators and tv channels, and fair for the co

Combinatorial Optimization: Theory and A

📁 Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics)

✍ Bernhard Korte, Jens Vygen 📂 Library 📅 2005 🏛 Springer 🌐 English

This is the most comprehensive compilation on combinatorial optiomization I have seen so far. Usually, Papadimitriou's book is a good place for this material - but in many cases, looking for proofs and theorems - I had to use several books: (*) Combinatorial Optimization Algorithms and Complexity by

Combinatorial Optimization: Theory and A

📁 Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics)

✍ Bernhard Korte, Jens Vygen 📂 Library 📅 2002 🏛 Springer 🌐 English

Combinatorial Optimization: Theory and A

📁 Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics)

✍ Bernhard Korte 📂 Library 📅 2012 🏛 Springer 🌐 English

<span>This comprehensive textbook on combinatorial optimization places specialemphasis on theoretical results and algorithms with provably goodperformance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This

Capacitated Planned Maintenance: Models,

📁 Capacitated Planned Maintenance: Models, Optimization Algorithms, Combinatorial and Polyhedral Properties

✍ Torben Kuschel (auth.) 📂 Library 📅 2017 🏛 Springer International Publishing 🌐 English

<p>This book examines the problem of maintenance planning and scheduling in industrial production systems. It presents two practically relevant, deterministic mathematical models: the capacitated planned maintenance problem (CPMP) and the weighted uncapacitated planned maintenance problem (WUPMP). I

Geometric Algorithms and Combinatorial O

📁 Geometric Algorithms and Combinatorial Optimization, Second Edition (Algorithms and Combinatorics)

✍ Martin Grötschel, Laszlo Lovasz, Alexander Schrijver 📂 Library 📅 1993 🏛 Springer 🌐 English

This book develops geometric techniques for proving the polynomial time solvability of problems in convexity theory, geometry, and, in particular, combinatorial optimization. It offers a unifying approach which is based on two fundamental geometric algorithms: the ellipsoid method for finding a poin