{"created":"2023-05-15T12:20:27.596533+00:00","id":11038,"links":{},"metadata":{"_buckets":{"deposit":"da8bb9f6-4a11-4ee4-b20a-4fa422dc05f4"},"_deposit":{"created_by":1,"id":"11038","owners":[1],"pid":{"revision_id":0,"type":"depid","value":"11038"},"status":"published"},"_oai":{"id":"oai:kansai-u.repo.nii.ac.jp:00011038","sets":["528:1538:1587"]},"author_link":["23636","23635"],"item_9_biblio_info_7":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2003-06","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"2","bibliographicPageEnd":"163","bibliographicPageStart":"145","bibliographicVolumeNumber":"46","bibliographic_titles":[{"bibliographic_title":"Journal of the Operations Research Society of Japan"}]}]},"item_9_description_4":{"attribute_name":"概要","attribute_value_mlt":[{"subitem_description":"An improved surrogate constraints method for solving separable nonlinear integer programming problems with multiple constraints is presented. The surrogate constraints method is very effective in solving problems with multiple constraints. The method solves a succession of surrogate constraints problems having a single constraint instead of the original multiple constraint problem. A surrogate problem with an optimal multiplier vector solves the original problem exactly if there is no duality gap. However, the surrogate constraints method often has a duality gap, that is it fails to find an exact solution to the original problem. The modification proposed closes the surrogate duality gap. The modification solves a succession of target problems that enumerates all solutions hitting a particular target. The target problems are produced by using an optimal surrogate multiplier vector. The computational results show that the modification is very effective at closing the surrogate gap of multiple constraint problems.","subitem_description_type":"Other"}]},"item_9_full_name_3":{"attribute_name":"著者別名","attribute_value_mlt":[{"nameIdentifiers":[{"nameIdentifier":"23636","nameIdentifierScheme":"WEKO"}],"names":[{"name":"Nakagawa, Yuji"}]}]},"item_9_publisher_34":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"日本オペレーションズ・リサーチ学会"}]},"item_9_relation_12":{"attribute_name":"DOI","attribute_value_mlt":[{"subitem_relation_type":"isIdenticalTo","subitem_relation_type_id":{"subitem_relation_type_id_text":"10.15807/jorsj.46.145","subitem_relation_type_select":"DOI"}}]},"item_9_rights_13":{"attribute_name":"権利","attribute_value_mlt":[{"subitem_rights":"(C) The Operations Research Society of Japan 2003, All rights reserved, Original Text is available at http://ci.nii.ac.jp/els/110001183565.pdf?id=ART0001514088&type=pdf&lang=jp&host=cinii&order_no=&ppv_type=0&lang_sw=&no=1352269014&cp="}]},"item_9_source_id_8":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"04534514","subitem_source_identifier_type":"ISSN"}]},"item_9_version_type_17":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"仲川, 勇二"}],"nameIdentifiers":[{"nameIdentifier":"23635","nameIdentifierScheme":"WEKO"},{"nameIdentifier":"60141925","nameIdentifierScheme":"e-Rad","nameIdentifierURI":"https://nrid.nii.ac.jp/ja/nrid/1000060141925"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2019-05-22"}],"displaytype":"detail","filename":"KU-1100-20030600-15.pdf","filesize":[{"value":"305.9 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"KU-1100-20030600-15.pdf","url":"https://kansai-u.repo.nii.ac.jp/record/11038/files/KU-1100-20030600-15.pdf"},"version_id":"73a24c9b-d3b7-406a-bb5f-3dfd1462dbcb"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"Combinatorial optimization","subitem_subject_scheme":"Other"},{"subitem_subject":"discrete optimization","subitem_subject_scheme":"Other"},{"subitem_subject":"separable nonlinear integer programming","subitem_subject_scheme":"Other"},{"subitem_subject":"multidimensional knapsack","subitem_subject_scheme":"Other"},{"subitem_subject":"nonlinear knapsack","subitem_subject_scheme":"Other"},{"subitem_subject":"surrogate constraints","subitem_subject_scheme":"Other"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"journal article","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"An Improved Surrogate Constraints Method for Separable Nonlinear Integer Programming","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"An Improved Surrogate Constraints Method for Separable Nonlinear Integer Programming"}]},"item_type_id":"9","owner":"1","path":["1587"],"pubdate":{"attribute_name":"公開日","attribute_value":"2012-12-10"},"publish_date":"2012-12-10","publish_status":"0","recid":"11038","relation_version_is_last":true,"title":["An Improved Surrogate Constraints Method for Separable Nonlinear Integer Programming"],"weko_creator_id":"1","weko_shared_id":1},"updated":"2023-05-15T15:40:04.663986+00:00"}