Publication

プレプリント

• H.Masuyama, H.Dan and S.Umetani, Curse of scale freeness: Intractability of large-scale combinatorial optimization with multi-start methods, arXiv preprints, arXiv:2210.16678, 2022. paper

• S.Umetani and S.Murakami, Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes, arXiv preprints, arXiv:2104.04525, 2021. paper

• N.Uematsu, S.Umetani and Y.Kawahara, An efficient branch-and-cut algorithm for approximately submodular function maximization, arXiv preprints, arXiv:1904.12682, 2019. paper

• N.Uematsu, S.Umetani and Y.Kawahara, An efficient branch-and-bound algorithm for submodular function maximization, arXiv preprints, arXiv:1811.04177, 2018. paper

• S.Umetani, M.Arakawa and M.Yagiura, Relaxation heuristics for the set multicover problem with generalized upper bound constraints, arXiv preprints, arXiv:1705.04970, 2017. paper

• S.Umetani, Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs, arXiv preprints, arXiv:1604.08448, 2016. paper

学術雑誌

• S.Umetani and S.Murakami, Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes, European Journal of Operational Research, 303 (2022), 1009-1026. DOI: 10.1016/j.ejor.2022.03.034 (open access)

• N.Uematsu, S.Umetani and Y.Kawahara, An efficient branch-and-cut algorithm for submodular function maximization, Journal of the Operations Research Society of Japan, 63 (2020), 41-59. DOI: 10.15807/jorsj.63.41 (open access) supplement 

• 橘高 源太, 伊藤 靖彦, 梅谷 俊治, 池上 敦子, コース科目が存在する場合の試験答案返却時間割作成の最適化モデル, 情報処理学会論文誌：数理モデル化と応用, 11 (2018), 26-31.

• S.Umetani, M.Arakawa and M.Yagiura, Relaxation heuristics for the set multicover problem with generalized upper bound constraints, Computers and Operations Research, 93 (2018), 90-100. DOI: 10.1016/j.cor.2018.01.007 (open access) supplement 

• S.Umetani, Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs, European Journal of Operational Research, 263 (2017), 72-81. DOI: 10.1016/j.ejor.2017.05.025 (open access) supplement 

• S.Umetani, Y.Fukushima and H.Morita, A linear programming based heuristic algorithm for charge and discharge scheduling of electric vehicles in a building energy management system, Omega, The International Journal of Management Science, 67 (2017), 115-122. DOI: 10.1016/j.omega.2016.04.005

• 西野 正彬, 鈴木 潤, 梅谷 俊治, 平尾 努, 永田昌明, 集合分割問題に基づく系列アラインメントのモデル化, 自然言語処理, 23 (2016), 175-194.

• K.Matsumoto, S.Umetani and H.Nagamochi, On the one-dimensional stock cutting problem in the paper tube industry, Journal of Scheduling, 14 (2011), 281-290. DOI: 10.1007/s10951-010-0164-2

• 越川 満, 内山 将夫, 梅谷 俊治, 松井 知己, 山本 幹雄, 統計的機械翻訳におけるフレーズ対応最適化を利用したN-best翻訳候補のリランキング, 情報処理学会論文誌, 51 (2010), 1443-1451.

• S.Umetani, M.Yagiura, S.Imahori, T.Imamichi, K.Nonobe and T.Ibaraki, Solving the irregular strip packing problem via guided local search for overlap minimization, International Transactions in Operational Research, 16 (2009), 661-683. DOI: 10.1111/j.1475-3995.2009.00707.x

• S.Umetani and M.Yagiura, Relaxation heuristics for the set covering problem, Journal of the Operations Research Society of Japan, 50 (2007), 350-375. DOI: 10.15807/jorsj.50.350

• S.Umetani, M.Yagiura and T.Ibaraki, One-dimensional cutting stock problem with a given number of setups: A hybrid approach of metaheuristics and linear programming, Journal of Mathematical Modelling and Algorithms, 5 (2006), 43-64. DOI: 10.1007/s10852-005-9031-0

• S.Imahori, M.Yagiura, S.Umetani, S.Adachi and T.Ibaraki, Local search algorithms for the two-dimensional cutting stock problem with a given number of different patterns, In T.Ibaraki, K.Nonobe and M.Yagiura (eds.), Metaheuristics: Progress as Real Problem Solvers, Kluwer Academic Publishers, 181-202, 2005.

• S.Umetani, M.Yagiura and T.Ibaraki, An LP-based local search to the one dimensional cutting stock problem using a given number of cutting patterns, IEICE Transaction on Fundamentals of Electronics, Communications and Computer Sciences, E86-A (2003), 1093-1102.

• S.Umetani, M.Yagiura and T.Ibaraki, A local search approach to the pattern restricted one dimensional cutting stock problem, In M.G.C.Resende and J.P.Sousa (eds.), Metaheuristics: Computer Decision-Making, Kluwer Academic Publishers, 673-698, 2003. DOI: 10.1007/978-1-4757-4137-7_32

• S.Umetani, M.Yagiura and T.Ibaraki, One dimensional cutting stock problem to minimize the number of different patterns, European Journal of Operational Research, 146 (2003), 388-402. DOI: 10.1016/S0377-2217(02)00239-4

• 梅谷 俊治, 船曵 信生, 西川 清史, 最小極大マッチング問題のニューラルネットワーク並列解法の提案, 情報処理学会論文誌, 39 (1998), 559-566.

国際会議（査読付き）

• S.Ikeda, N.Nishimura, S.Umetani, Operation range estimation for price optimization, International Workshop on Data Mining for Service (DMS2023), 2023.

• N.Uematsu, S.Umetani and Y.Kawahara, An efficient branch-and-cut algorithm for approximately submodular function maximization, Proceedings of IEEE International Conference on Systems, Man, and Cybernetics (IEEE SMC 2019), 3160-3167, 2019.

• S.Umetani, Exploiting variable associations to configure efficient local search in large-scale set partitioning problems, Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI-15), 1226-1232, 2015. paper

• S.Umetani, M.Arakawa and M.Yagiura, A heuristic algorithm for the set multicover problem with generalized upper bound constraints, Proceedings of Learning and Intelligent Optimization Conference (LION7), Lecture Notes in Computer Science, 7997 (2013), 75-80. DOI: 10.1007/978-3-642-44973-4_9

• Y.Hara, S.Umetani and H.Morita, A combined approach for production scheduling and routing of automated guided vehicles with layered time-space network, Proceedings of the ASME 2012 International Symposium on Flexible Automation (ISFA2012), 7187/1-4, 2012. DOI: 10.1115/ISFA2012-7187

• T.Demizu, S.Umetani and H.Morita, Optimal electric power management in a residential building using photovoltaic and storage battery, Proceedings of the ASME 2012 International Symposium on Flexible Automation (ISFA2012), 7162/1-4, 2012. DOI: 10.1115/ISFA2012-7162

• K.Murakami, S.Umetani and H.Morita, A two-probe routing model and an algorithm for MCM substrates testing, Proceedings of International Symposium on Scheduling 2011 (ISS2011), 241-246, 2011.

• Y.Fukushima, S.Umetani, H.Morita, S.Iida and M.Kobayashi, Robust energy management system with electric vehicles, Proceedings of International Symposium on Scheduling 2011 (ISS2011), 117-122, 2011.

• V.Virtanen, S.Umetani and H.Morita, Two-probe routing in inspection of circuit boards, Proceedings of International Symposium on Scheduling 2009 (ISS2009), 52-57, 2009.

• S.Umetani, M.Yagiura, T.Imamichi, S.Imahori, K.Nonobe and T.Ibaraki, A local search algorithm based on overlap minimization for the irregular strip packing problem, Proceedings of the 7th Metaheuristics International Conference (MIC2007), 35/1-3, 2007.

• S.Umetani, M.Yagiura, T.Imamichi, S.Imahori, K.Nonobe and T.Ibaraki, A guided local search algorithm based on a fast neighborhood search for the irregular strip packing problem, Proceedings of International Symposium on Scheduling 2006 (ISS2006), 126-131, 2006.

• S.Umetani, T.Kurakake, Y.Suzuki and M.Higashi, A bi-directional local search for robot motion planning problem with many degrees of freedom, Proceedings of the 6th Metaheuristics International Conference (MIC2005), 878-883, 2005.

• S.Umetani, M.Yagiura and T.Ibaraki, One-dimensional cutting stock problem with a given number of setups: A hybrid approach of metaheuristics and linear programming, Proceedings of the 1st International Workshop on Hybrid Metaheuristics (HM2004), 101-114, 2004.

• S.Umetani, M.Yagiura and T.Ibaraki, An LP-based local search for one dimensional cutting stock problem, Proceedings of the 5th Metaheuristics International Conference (MIC2003), 75/1-8, 2003.

• S.Imahori, M.Yagiura, S.Umetani, S.Adachi and T.Ibaraki, Local search algorithms for the two dimensional cutting stock problem with a given number of patterns, Proceedings of the 5th Metaheuristics International Conference (MIC2003), 35/1-6, 2003.

• S.Imahori, M.Yagiura, S.Umetani, S.Adachi and T.Ibaraki, Local search algorithms for the two dimensional cutting stock problem with a given number of patterns, Proceedings of the 7th World Multi-Conference on Systemics, Cybernetics and Informatics (SCI2003), 4/334-339, 2003.

• S.Umetani, M.Yagiura and T.Ibaraki, An LP-based local search to the one dimensional cutting stock problem using a given number of cutting patterns, Proceedings of the 1st International Workshop on Heuristics (IWH2002), 28-38, 2002.

• S.Umetani, M.Yagiura and T.Ibaraki, A local search approach for one dimensional cutting stock problem, Proceedings of the 4th Meteheuristics International Conference (MIC2001), 69-73, 2001.

著書

• 梅谷 俊治, しっかり学ぶ数理最適化：モデルからアルゴリズムまで, 講談社, 2020.  support site

• 太田 快人, 酒井 英昭, 高橋 豊, 田中 利幸, 永持 仁, 福島 雅夫(編集), 数理工学事典, 朝倉書店, 2011. (V章. ネットワーク関連, 2.7節ビンパッキング問題 分担執筆)

• 藤澤 克樹, 梅谷 俊治, 応用に役立つ50の最適化問題(応用最適化シリーズ3), 朝倉書店, 2009.

解説

• 坂本 淳子, 大野 修平, 永橋 幸大, 鈴木 保乃加, 梅谷 俊治, 自動車船の運航業務に数理最適化を適用するための実践的なアプローチ, オペレーションズ・リサーチ, 66 (2021), 414-421.

• 梅谷 俊治, 組合せ最適化による問題解決の実践的なアプローチ, オペレーションズ・リサーチ,66 (2021), 362-366.

• 梅谷 俊治, ビットマップ図形の効率的な詰込み,オペレーションズ・リサーチ, 61 (2016), 742-743. paper

• 梅谷 俊治, アルゴリズム実装を教える, オペレーションズ・リサーチ, 59 (2014), 615-621. paper

• 梅谷 俊治, 組合せ最適化入門：線形計画から整数計画まで, 自然言語処理, 21 (2014), 1059-1090. paper

• 梅谷 俊治, 問題構造の解析に基づく組合せ最適化アルゴリズムの自動構成, オペレーションズ・リサーチ, 59 (2014), 20-25. paper

• 梅谷 俊治, 柳浦睦憲, メタヒューリスティクス事始め：まずは局所探索法から, オペレーションズ・リサーチ, 58 (2013), 689-694. paper

• 梅谷 俊治, 切出し・詰込み問題に対する実用的解法, 生産と技術, 61 (2009), 56-58.

• 梅谷 俊治, 今堀 慎治, 切出し・詰込み問題とその応用 −(3)多角形詰込み問題−, オペレーションズ・リサーチ, 50 (2005), 403-408. paper

• 今堀 慎治, 梅谷 俊治, 切出し・詰込み問題とその応用 −(2)長方形詰込み問題−, オペレーションズ・リサーチ, 50 (2005), 335-340. paper

• 梅谷 俊治, 今堀 慎治, 切出し・詰込み問題とその応用 −(1)1次元資材切出し問題−, オペレーションズ・リサーチ, 50 (2005), 270-276. paper

学位論文

• 梅谷俊治, Studies on local search approaches to one dimensional cutting stock problems, 京都大学 大学院情報学研究科 数理工学専攻 博士論文, 2003.

• 梅谷俊治, 離散型ニューラルネットワークの安定性と最小極大マッチング問題の解法の研究, 大阪大学 大学院基礎工学研究科 情報数理系専攻 修士論文, 1998.

特許

• 西野 正彬, 鈴木 潤, 梅谷俊治, 文対応付け決定装置、方法、及びプログラム, 特許第6019538号(特願2014-044351), 2014/10/14.

• 西野 正彬, 鈴木 潤, 平尾 努, 梅谷俊治, 情報処理、装置、及びプログラム, 特許第6482073号(特願2015-116059), 2015/6/8.