Publication

Preprints

• S.Ikeda, N.Nishimura and S.Umetani, Interpretable price bounds estimation with shape constraints in price optimization, arXiv: 2405.14909, 2024. paper

• 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

Papers in reviewed journals

• 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 

• G.Kittaka, Y.Ito, S.Umetani and A.Ikegami, Optimization models for timetabling of class counseling on the results of examinations in the presence of elective courses, Transactions on mathematical modeling and its applications, Information Processing Society of Japan,  11 (2018), 26-31, written in Japanese.

• 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

• M.Nishino, J.Suzuki, S.Umetani, T.Hirao and M.Nagata, Sequence alignment as a set partitioning problem, Journal of Natural Language Processing, 23 (2016), 175-194, written in Japanese.

• 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

• M.Koshikawa, M.Utiyama, S.Umetani, T.Matsui and M.Yamamoto, N-best reranking using optimal phrase alignment for statistical machine translation, Transactions of the Information Processing Society of Japan, 51 (2010), 1443-1451, written in Japanese.

• 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 paper 

• 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 

• S.Umetani, N.Funabiki and S.Nishikawa, A neural network parallel algorithm for minimum maximal matching problems, Transactions of the Information Processing Society of Japan, 39 (1998), 559-566, written in Japanese.

Papers in reviewed conferences

• 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.