Abstract
This chapter focuses on branching schemes in line with decomposition schemes following the first-break-then-schedule idea (see section 2.4.2 for details). We consider the LP relaxation of the problem at hand, solve it to optimality, and branch on the venue of team i in period p. Accordingly, we construct a branching tree where a path from the root node to a leaf either can be pruned or represents a full HAP set
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2008). Home-Away-Pattern Based Branching Schemes. In: Sports Leagues Scheduling. Lecture Notes in Economics and Mathematical Systems, vol 603. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75518-0_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-75518-0_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75517-3
Online ISBN: 978-3-540-75518-0
eBook Packages: Business and EconomicsBusiness and Management (R0)