haku: @indexterm quadratic programming / yhteensä: 24
viite: 15 / 24
| Tekijä: | Eislet, H.A. Laporte, G. |
| Otsikko: | A combinatorial optimisation problem arising in dartboard design |
| Lehti: | Journal of the Operational Research Society
1991 : FEB, VOL. 42:2, p. 113-118 |
| Asiasana: | OPERATIONAL RESEARCH GAME THEORY TRAVELLING SALESMAN PROBLEM QUADRATIC PROGRAMMING |
| Kieli: | eng |
| Tiivistelmä: | The problem of optimally locating the numbers around a dartboard is investigated. The game of darts is one of the most universally played games in the British Isles. The objective considered is risk maximization. Under different assumptions, the problem can be formulated as a travelling salesman problem /TSP/, as a quadratic assignment problem /QAP/, or as a more general assignment problem without subtours. Various dartboard designs are proposed and compared with the current one. Results show that the TSP model with additional constraints produces dartboard designs that seem superior to the current situation. |
SCIMA