Skip to main content
Log in

A Combinatorial Optimization Problem Arising in Dartboard Design

  • Case-Oriented Paper
  • Published:
Journal of the Operational Research Society

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1057/jors.1991.21

Keywords

Navigation