| One-dimensional cutting stock problem to minimize the number of different patterns S Umetani, M Yagiura, T Ibaraki European Journal of Operational Research 146 (2), 388-402, 2003 | 163 | 2003 |
| A linear programming based heuristic algorithm for charge and discharge scheduling of electric vehicles in a building energy management system S Umetani, Y Fukushima, H Morita Omega 67, 115-122, 2017 | 116 | 2017 |
| Relaxation heuristics for the set covering problem S Umetani, M Yagiura Journal of the Operations Research Society of Japan 50 (4), 350-375, 2007 | 89 | 2007 |
| Solving the irregular strip packing problem via guided local search for overlap minimization S Umetani, M Yagiura, S Imahori, T Imamichi, K Nonobe, T Ibaraki International Transactions in Operational Research 16 (6), 661-683, 2009 | 53 | 2009 |
| One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming S Umetani, M Yagiura, T Ibaraki Journal of Mathematical Modelling and Algorithms 5 (1), 43-64, 2006 | 46 | 2006 |
| On the one-dimensional stock cutting problem in the paper tube industry K Matsumoto, S Umetani, H Nagamochi Journal of Scheduling 14 (3), 281-290, 2011 | 35 | 2011 |
| An LP-based local search to the one dimensional cutting stock problem using a given number of cutting patterns S Umetani, M Yagiura, T Ibaraki IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and …, 2003 | 16 | 2003 |
| Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs S Umetani European Journal of Operational Research 263 (1), 72-81, 2017 | 14 | 2017 |
| Local search algorithms for the two-dimensional cutting stock problem with a given number of different patterns S Imahori, M Yagiura, S Umetani, S Adachi, T Ibaraki Metaheuristics: progress as real problem solvers, 181-202, 2005 | 14 | 2005 |
| Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes S Umetani, S Murakami European journal of operational research 303 (3), 1009-1026, 2022 | 11 | 2022 |
| Exploiting variable associations to configure efficient local search in large-scale set partitioning problems S Umetani Twenty-Ninth AAAI Conference on Artificial Intelligence, 1226-1232, 2015 | 9 | 2015 |
| A heuristic algorithm for the set multicover problem with generalized upper bound constraints S Umetani, M Arakawa, M Yagiura Learning and Intelligent Optimization: 7th International Conference, LION 7 …, 2013 | 7 | 2013 |
| Relaxation heuristics for the set multicover problem with generalized upper bound constraints S Umetani, M Arakawa, M Yagiura Computers & Operations Research, 2018 | 6 | 2018 |
| 組合せ最適化入門: 線形計画から整数計画まで 梅谷俊治 自然言語処理 21 (5), 1059-1090, 2014 | 6 | 2014 |
| A bi-directional local search for robot motion planning problem with many degrees of freedom S Umetani, T Kurakake, Y Suzuki, M Higashi The 6th Metaheuristics International Conference MIC, 878-883, 2005 | 6 | 2005 |
| A local search approach for one dimensional cutting stock problem S Umetani, M Yagiura, T Ibaraki Metaheuristics International Conference 4, 69-73, 2001 | 5 | 2001 |
| Sequence alignment as a set partitioning problem M Nishino, J Suzuki, S Umetani, T Hirao, M Nagata 自然言語処理 23 (2), 175-194, 2016 | 4 | 2016 |
| A guided local search algorithm based on a fast neighborhood search for the irregular strip packing problem S Umetani, M Yagiura, T Imamichi, S Imahori, K Nonobe, T Ibaraki Proceedings of International Symposium on Scheduling (ISS2006), 126-131, 2006 | 4* | 2006 |
| A local search approach for the pattern restricted one dimensional cutting stock problem S Umetani, M Yagiura, T Ibaraki Metaheuristics, 673-698, 2004 | 4 | 2004 |
| An efficient branch-and-cut algorithm for submodular function maximization N Uematsu, S Umetani, Y Kawahara Journal of the Operations Research Society of Japan 63 (2), 41-59, 2020 | 3 | 2020 |
HIROSHI MORITAOsaka University在 ist.osaka-u.ac.jp 的电子邮件经过验证
