Constructing fair round robin tournaments with a minimum number of breaks (2010)
Attributed to:
Exact algorithms for NP-hard problems
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1016/j.orl.2010.08.008
Publication URI: http://dx.doi.org/10.1016/j.orl.2010.08.008
Type: Journal Article/Review
Parent Publication: Operations Research Letters
Issue: 6