{"id":32547,"updated":"2025-01-22T16:07:30.972676+00:00","links":{},"created":"2025-01-18T23:01:36.503214+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00032547","sets":["1164:2592:2700:2705"]},"path":["2705"],"owner":"1","recid":"32547","title":["多角形内部の格子点列挙と2変数整数計画問題への応用"],"pubdate":{"attribute_name":"公開日","attribute_value":"1992-03-23"},"_buckets":{"deposit":"9788255a-9f7b-4b7e-bc36-f5aa9c8417e7"},"_deposit":{"id":"32547","pid":{"type":"depid","value":"32547","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"多角形内部の格子点列挙と2変数整数計画問題への応用","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"多角形内部の格子点列挙と2変数整数計画問題への応用"},{"subitem_title":"Efficient Enumeration of Grid Points in a Polygon and its Application to Integer Programming","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"1992-03-23","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東北大学工学部通信工学科"},{"subitem_text_value":"東北大学工学部情報工学科"},{"subitem_text_value":"大阪電気通信大学"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Electorical Communications Faculty of Engineering, Tohoku University","subitem_text_language":"en"},{"subitem_text_value":"Department of Information Engineering Faculty of Engineering, Tohoku University","subitem_text_language":"en"},{"subitem_text_value":"Osaka Electro - Communication University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"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/32547/files/IPSJ-AL91026004.pdf"},"date":[{"dateType":"Available","dateValue":"1994-03-23"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL91026004.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":"9"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"c026e457-ced3-494b-80ef-40f2386046ee","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1992 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"金丸, 直義"},{"creatorName":"西関, 隆夫"},{"creatorName":"浅野, 哲夫"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Naoyoshi, Kanamaru","creatorNameLang":"en"},{"creatorName":"Takao, Nishizeki","creatorNameLang":"en"},{"creatorName":"Tetsuo, Asano","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN1009593X","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"本報告では，与えられた凸m角形内部のすべての整数格子点を列挙するO（+m+log　）時間のアルゴリズムを与える．ここでKは列挙された格子点の個数であり，nは凸m角形の大きさ，すなわちm角形を包含する軸平行な長方形の垂直，水平な辺のうち短い方の長さである．さらに，m個の制約式を持つ2変数整数計画問題を解くO（　log　m+log　）時間のアルゴリズムを与える．ここでnは計画問題の許容解空間である凸多角形の大きさを表す．このアルゴリズムは従来知られているアルゴリズムより単純であり，時間計算量も改善している．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"This paper presents an algorithm for enumerating all the integer-grid points in a given convex m-gon in O(K+m+log n) time where K is the number of such grid points and n is the dimension of the m-gon, i.e., the shorter length of the horizontal and vertical sides of an axis-parallel rectangle enclosing the m-gon. Furthermore the paper gives a simple algorithm which solves a two-variable integer programming problem with m constraints in O(m log m+log n) time where n is the dimension of a convex polygon corresponding to the feasible solution space. This improves the best known algorithm in complexity and simplicity.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"32","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"25","bibliographicIssueDates":{"bibliographicIssueDate":"1992-03-23","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"27(1991-AL-026)","bibliographicVolumeNumber":"1992"}]},"relation_version_is_last":true,"weko_creator_id":"1"}}