Abstract
In this paper, the problem of optimally locating the numbers around a dartboard is investigated. The objective considered is risk maximization. Under different assumptions, the problem can be formulated as a travelling salesman problem, as a quadratic assignment problem, or as a more general assignment problem without subtours. Various dartboard designs are proposed and compared with the current one.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Eiselt, H., Laporte, G. A Combinatorial Optimization Problem Arising in Dartboard Design. J Oper Res Soc 42, 113–118 (1991). https://doi.org/10.1057/jors.1991.21
Published:
Issue Date:
DOI: https://doi.org/10.1057/jors.1991.21