{"id":82603,"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00082603","sets":["581:6644:6801"]},"path":["6801"],"owner":"11","recid":"82603","title":["Rogo, a TSP-based Paper Puzzle: Optimization Approaches"],"pubdate":{"attribute_name":"公開日","attribute_value":"2012-06-15"},"_buckets":{"deposit":"905385cc-5689-4282-be86-1fd62bbb11df"},"_deposit":{"id":"82603","pid":{"type":"depid","value":"82603","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"Rogo, a TSP-based Paper Puzzle: Optimization Approaches","author_link":["358017","358018","358019","358020"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Rogo, a TSP-based Paper Puzzle: Optimization Approaches"},{"subitem_title":"Rogo, a TSP-based Paper Puzzle: Optimization Approaches","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"[特集：パズルの数理]  combinatorial optimzation, puzzles, enumeration algorithms","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"2012-06-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"University of Canterbury"},{"subitem_text_value":"University of Canterbury"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"University of Canterbury","subitem_text_language":"en"},{"subitem_text_value":"University of Canterbury","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"publish_status":"0","weko_shared_id":11,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/82603/files/IPSJ-JNL5306006.pdf","label":"IPSJ-JNL5306006"},"date":[{"dateType":"Available","dateValue":"2014-06-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL5306006.pdf","filesize":[{"value":"1.2 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"4abb024a-27a2-4b28-a01b-4149b7465e42","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2012 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Shane, Dye"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"NicolaWardPetty"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Shane, Dye","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Nicola, WardPetty","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_2_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00116647","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_2_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7764","subitem_source_identifier_type":"ISSN"}]},"item_2_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"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.\n\n------------------------------ \nThis is a preprint of an article intended for publication Journal of \nInformation Processing(JIP). This preprint should not be cited. This \narticle should be cited as: Journal of Information Processing Vol.20(2012) No.3 (online) \nDOI　http://dx.doi.org/10.2197/ipsjjip.20.672\n------------------------------ \n","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"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.\n\n------------------------------ \nThis is a preprint of an article intended for publication Journal of \nInformation Processing(JIP). This preprint should not be cited. This \narticle should be cited as: Journal of Information Processing Vol.20(2012) No.3 (online) \nDOI　http://dx.doi.org/10.2197/ipsjjip.20.672\n------------------------------ \n","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicIssueDates":{"bibliographicIssueDate":"2012-06-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"6","bibliographicVolumeNumber":"53"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"updated":"2025-01-20T06:51:10.713751+00:00","created":"2025-01-18T23:36:26.662633+00:00","links":{}}