WEKO3
アイテム
Rogo, a TSP-based Paper Puzzle: Optimization Approaches
https://ipsj.ixsq.nii.ac.jp/records/82603
https://ipsj.ixsq.nii.ac.jp/records/82603250a7436-6f8d-46a8-9d92-d24b883e03cb
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-JNL5306006 (1.2 MB)
|
Copyright (c) 2012 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | Journal(1) | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2012-06-15 | |||||||||
| タイトル | ||||||||||
| タイトル | Rogo, a TSP-based Paper Puzzle: Optimization Approaches | |||||||||
| タイトル | ||||||||||
| 言語 | en | |||||||||
| タイトル | Rogo, a TSP-based Paper Puzzle: Optimization Approaches | |||||||||
| 言語 | ||||||||||
| 言語 | eng | |||||||||
| キーワード | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | [特集：パズルの数理] combinatorial optimzation, puzzles, enumeration algorithms | |||||||||
| 資源タイプ | ||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||
| 資源タイプ | journal article | |||||||||
| 著者所属 | ||||||||||
| University of Canterbury | ||||||||||
| 著者所属 | ||||||||||
| University of Canterbury | ||||||||||
| 著者所属(英) | ||||||||||
| en | ||||||||||
| University of Canterbury | ||||||||||
| 著者所属(英) | ||||||||||
| en | ||||||||||
| University of Canterbury | ||||||||||
| 著者名 |
Shane, Dye
× Shane, Dye
× NicolaWardPetty
|
|||||||||
| 著者名(英) |
Shane, Dye
× Shane, Dye
× Nicola, WardPetty
|
|||||||||
| 論文抄録 | ||||||||||
| 内容記述タイプ | Other | |||||||||
| 内容記述 | Rogo® is a new type of mathematical puzzle, invented in 2009. Rogo is a prize-collecting subset-selection TSP on a grid. Grid squares can be blank, forbidden, or show a reward value. The object is to accumulate the biggest score using a given number of steps in a loop around the grid. This paper introduces Rogo as a discrete optimisation problem. An IP formulation is given for the problem with two alternative sets of subtour elimination constraints. Enumeration-based algorithms are also proposed based on properties of solutions and Rogo instances. Some results of computational experiments are reported. ------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.20(2012) No.3 (online) DOI http://dx.doi.org/10.2197/ipsjjip.20.672 ------------------------------ |
|||||||||
| 論文抄録(英) | ||||||||||
| 内容記述タイプ | Other | |||||||||
| 内容記述 | Rogo® is a new type of mathematical puzzle, invented in 2009. Rogo is a prize-collecting subset-selection TSP on a grid. Grid squares can be blank, forbidden, or show a reward value. The object is to accumulate the biggest score using a given number of steps in a loop around the grid. This paper introduces Rogo as a discrete optimisation problem. An IP formulation is given for the problem with two alternative sets of subtour elimination constraints. Enumeration-based algorithms are also proposed based on properties of solutions and Rogo instances. Some results of computational experiments are reported. ------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.20(2012) No.3 (online) DOI http://dx.doi.org/10.2197/ipsjjip.20.672 ------------------------------ |
|||||||||
| 書誌レコードID | ||||||||||
| 収録物識別子タイプ | NCID | |||||||||
| 収録物識別子 | AN00116647 | |||||||||
| 書誌情報 |
情報処理学会論文誌 巻 53, 号 6, 発行日 2012-06-15 |
|||||||||
| ISSN | ||||||||||
| 収録物識別子タイプ | ISSN | |||||||||
| 収録物識別子 | 1882-7764 | |||||||||
