{"created":"2021-03-01T06:34:53.718009+00:00","id":26932,"links":{},"metadata":{"_buckets":{"deposit":"27eb4cbd-bd03-4e0d-84e7-7a5a377b204b"},"_deposit":{"id":"26932","owners":[],"pid":{"revision_id":0,"type":"depid","value":"26932"},"status":"published"},"_oai":{"id":"oai:nagoya.repo.nii.ac.jp:00026932","sets":["312:313:314"]},"author_link":["88249","88250","88251","88252"],"item_10_biblio_info_6":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2018-11","bibliographicIssueDateType":"Issued"},"bibliographicPageEnd":"110","bibliographicPageStart":"98","bibliographicVolumeNumber":"125","bibliographic_titles":[{"bibliographic_title":"Computers & Industrial Engineering","bibliographic_titleLang":"en"}]}]},"item_10_description_4":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"We consider the generalized assignment problem (GAP) with min-max regret criterion under interval costs. This problem models many real-world applications in which jobs must be assigned to agents but the costs of assignment may vary after the decision has been taken. We computationally examine two heuristic methods: a fixed-scenario approach and a dual substitution algorithm. We also examine exact algorithmic approaches (Benders-like decomposition and branch-and-cut) and further introduce a more sophisticated algorithm that incorporates various methodologies, including Lagrangian relaxation and variable fixing. The resulting Lagrangian-based branch-and-cut algorithm performs satisfactorily on benchmark instances.","subitem_description_language":"en","subitem_description_type":"Abstract"}]},"item_10_description_5":{"attribute_name":"内容記述","attribute_value_mlt":[{"subitem_description":"ファイル公開：2021-11-01","subitem_description_language":"ja","subitem_description_type":"Other"}]},"item_10_publisher_32":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"Elsevier","subitem_publisher_language":"en"}]},"item_10_relation_11":{"attribute_name":"DOI","attribute_value_mlt":[{"subitem_relation_type":"isVersionOf","subitem_relation_type_id":{"subitem_relation_type_id_text":"https://doi.org/10.1016/j.cie.2018.08.007","subitem_relation_type_select":"DOI"}}]},"item_10_rights_12":{"attribute_name":"権利","attribute_value_mlt":[{"subitem_rights":"© 2018. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/","subitem_rights_language":"en"}]},"item_10_select_15":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_select_item":"author"}]},"item_10_source_id_61":{"attribute_name":"ISSN（print）","attribute_value_mlt":[{"subitem_source_identifier":"0360-8352","subitem_source_identifier_type":"PISSN"}]},"item_1615787544753":{"attribute_name":"出版タイプ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_ab4af688f83e57aa","subitem_version_type":"AM"}]},"item_access_right":{"attribute_name":"アクセス権","attribute_value_mlt":[{"subitem_access_right":"open access","subitem_access_right_uri":"http://purl.org/coar/access_right/c_abf2"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Wu, Wei","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"88249","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"Iori, Manuel","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"88250","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"Martello, Silvano","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"88251","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"Yagiura, Mutsunori","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"88252","nameIdentifierScheme":"WEKO"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2021-11-01"}],"displaytype":"detail","filename":"manuscript.pdf","filesize":[{"value":"167.9 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"manuscript","objectType":"fulltext","url":"https://nagoya.repo.nii.ac.jp/record/26932/files/manuscript.pdf"},"version_id":"62379d1c-d1dc-4072-858f-117b6c0a8d9e"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"Combinatorial optimization","subitem_subject_scheme":"Other"},{"subitem_subject":"Min-max regret generalized assignment problem","subitem_subject_scheme":"Other"},{"subitem_subject":"Branch-and-cut","subitem_subject_scheme":"Other"},{"subitem_subject":"Lagrangian relaxation","subitem_subject_scheme":"Other"},{"subitem_subject":"Variable fixing","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":"Exact and heuristic algorithms for the interval min-max regret generalized assignment problem","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Exact and heuristic algorithms for the interval min-max regret generalized assignment problem","subitem_title_language":"en"}]},"item_type_id":"10","owner":"1","path":["314"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2018-12-25"},"publish_date":"2018-12-25","publish_status":"0","recid":"26932","relation_version_is_last":true,"title":["Exact and heuristic algorithms for the interval min-max regret generalized assignment problem"],"weko_creator_id":"1","weko_shared_id":-1},"updated":"2023-01-16T04:29:22.523044+00:00"}