{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00233726","sets":["581:11492:11496"]},"path":["11496"],"owner":"44499","recid":"233726","title":["A Subtour Elimination Constraint for Non-simpl e Circuit Problems"],"pubdate":{"attribute_name":"公開日","attribute_value":"2024-04-15"},"_buckets":{"deposit":"a1dccbae-191d-44f9-bf4f-f50439dd8477"},"_deposit":{"id":"233726","pid":{"type":"depid","value":"233726","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"A Subtour Elimination Constraint for Non-simpl e Circuit Problems","author_link":["635521","635520"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"A Subtour Elimination Constraint for Non-simpl e Circuit Problems"},{"subitem_title":"A Subtour Elimination Constraint for Non-simpl e Circuit Problems","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"[一般論文] Non-simple circuit, Orienteering problem, Subtour elimination constraint, Callback function provided in solvers","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"2024-04-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Department of Computer Science, National Defense Academy"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Computer Science, National Defense Academy","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/233726/files/IPSJ-JNL6504007.pdf","label":"IPSJ-JNL6504007.pdf"},"date":[{"dateType":"Available","dateValue":"2026-04-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL6504007.pdf","filesize":[{"value":"861.5 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"5"},{"tax":["include_tax"],"price":"0","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"345915f6-57fc-4372-96a4-652369bf45a0","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2024 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Seiji, Kataoka"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Seiji, Kataoka","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_publisher_15":{"attribute_name":"公開者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"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":"In various problems on graphs to find the optimal path or circuit, feasible solutions are normally assumedto be simple. In reality, however, one-way or return roads, bridges connecting enclaves, etc. often lead to multiplepasses through the same points or roads, i.e. a non-simple path or circuit. The difficulty in considering a non-simplepath or circuit is that conventional subtour elimination constraints are of no use. Taking the orienteering problem as atarget, we newly develop a subtour elimination constraint that works directly against non-simple type problems, andshow its effectiveness in computational experiments.\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.32(2024) (online)\nDOI　http://dx.doi.org/10.2197/ipsjjip.32.346\n------------------------------","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In various problems on graphs to find the optimal path or circuit, feasible solutions are normally assumedto be simple. In reality, however, one-way or return roads, bridges connecting enclaves, etc. often lead to multiplepasses through the same points or roads, i.e. a non-simple path or circuit. The difficulty in considering a non-simplepath or circuit is that conventional subtour elimination constraints are of no use. Taking the orienteering problem as atarget, we newly develop a subtour elimination constraint that works directly against non-simple type problems, andshow its effectiveness in computational experiments.\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.32(2024) (online)\nDOI　http://dx.doi.org/10.2197/ipsjjip.32.346\n------------------------------","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicIssueDates":{"bibliographicIssueDate":"2024-04-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"4","bibliographicVolumeNumber":"65"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":233726,"updated":"2025-01-19T10:00:34.550409+00:00","links":{},"created":"2025-01-19T01:35:16.396782+00:00"}