Talk

Invited talks

• S.Umetani, Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs, 2nd ISM-ZIB-IMI MODAL Workshop on Mathematical Optimization and Data Analysis, Berlin, Germany, 2017/9/22-26.

Presentations in international conferences

• T.Ishii, S.Seno, S.Umetani, H.Matsuda, A coarse-to-fine linear programming approach for spatial transcriptome deconvolution, GIW ISCB ASIA 2023, Singapre, 2023/11/18.

• S.Umetani, Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs, RIKEN AIP Open Seminar Series, online, 2021/3/17.

• A.Shigematsu, S.Umetani and N.Nishimura, Optimizing the ordered recommendation list in E-commerce sites via quadratic assignment problem, INFORMS Annual Meeting, Seattle, US, 2019/10/21-24.

• R.Matsumoto, S.Umetani and H.Morita, A Weighting Local Search Algorithm for the Constrained Binary Quadratic Program, INFORMS Annual Meeting, Phoenix, US, 2018/11/4-7.

• D.Tahara, S.Umetani and H.Morita, Tracking Passengers’ Routes in Urban Railway Networks Using Integer Programming, INFORMS Annual Meeting, Phoenix, US, 2018/11/4-7.

• T.Kan, S.Umetani and H.Morita, A weighting local search for huge assignment problem in item recommendation, 23rd International Symposium on Mathematical Programming (ISMP2018), Bordeaux, France, 2018/7/1-6.

• K.Fukuoka, H.Masuyama, H.Dan and S.Umetani, A statistical stopping criterion for simulated annealing, 23rd International Symposium on Mathematical Programming (ISMP2018), Bordeaux, France, 2018/7/1-6.

• N.Uematsu, S.Umetani and H.Morita, An Integer Programming Model of Route Assignment Problem for Reducing Traffic Congestion in Urban Area, INFORMS Annual Meeting, Houston, US, 2017/10/22-25.

• S.Umetani, S.Murakami and H.Morita, An efficient local search algorithm for nesting problems of rasterized shapes, 21st International Federation of Operational Research Societies (IFORS2017), Quebec, Canada, 2017/7/17-21.

• S. Umetani and Y.Shinano, Communicating with external heuristic solvers to improve the performance of MIP solvers, 22nd International Symposium on Mathematical Programming (ISMP 2015), Pittsburgh, US, 2015/7/12-17.

• S.Murakami, S.Umetani, Y.Nakano and H.Morita, An efficient local search algorithm for nesting problems of rasterized shapes, 22nd International Symposium on Mathematical Programming (ISMP 2015), Pittsburgh, US, 2015/7/12-17.

• S.Umetani, A.Kumano, T.Hasuike and H.Morita, Solving large-scale multi-target tracking problem to identify massive people flow in urban area, INFORMS Annual Meeting, San Francisco, US, 2014/11/9-12.

• S.Umetani, Variable association networks for identifying patterns in 0-1 integer programs, Conference for the International Federation of Operational Research Societies (IFORS2014), Barcelona, Spain, 2014/7/13-18.

• S.Umetani, A local search algorithm for large-scale set partitioning problems, The 13th Statistical Machine Learning Seminar, The Institute of Statistical Mathematics, Tokyo, Japan, 2013/11/21.

• S.Umetani, M.Arakawa and M.Yagiura, A heuristic algorithm for the set multicover problem with generalized upper bound constraints, 21st International Symposium on Mathematical Programming (ISMP 2012), Berlin, Germany, 2012/8/19-24.

• S.Umetani, M.Arakawa and M.Yagiura, A heuristic algorithm for the set multicover problem with generalized upper bound constraints, The 1st Graph CREST symposium, Chuo University, Tokyo, Japan, 2012/3/23.

• K.Murakami, S.Umetani and H.Morita, Two-probe routing model and algorithm for multi-chip module substrates, Conference for the International Federation of Operational Research Societies (IFORS2011), Melbourne, Australia, 2011/7/10-15.

• Y.Fukushima, S.Umetani and H.Morita, Total energy management system for electric vehicle operation using time-space network, INFORMS Annual Meeting, Austin, Texas, USA, 2010/11/7-10.

• S.Umetani, K.Matsumoto and H.Nagamochi, One-dimensional cutting stock problem for a paper tube industry, The 6th ESICUP Meeting, Valencia, Spain, 2010/3/25-27.

• M.Yamamoto, J.Norimatsu, M.Koshikawa, T.Fukutomi, T.Nishio, K.Sadamitsu, T.Utsuro, M.Utiyama, S.Umetani and Tomomi Matsui, Diversion of Hierarchical Phrases as Reordering Templates, The 7th NTCIR Workshop, Tokyo, Japan, 2008/12/16-19.

• S.Umetani, M.Yagiura, T.Imamichi, S.Imahori, K.Nonobe and T.Ibaraki, A metaheuristic approach based on overlap minimization for the irregular packing problem, The 4th ESICUP Meeting, University of Tokyo, Japan, 2007/3/26-27.

• S.Umetani, M.Yagiura, T.Imamichi, S.Imahori, K.Nonobe and T.Ibaraki, A metaheuristic approach based on overlap minimization for the irregular packing problem, Dagstuhl-Seminar on Cutting, Packing, Layout and Space Allocation, Dagstuhl, Germany, 2007/3/13-16.

• 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, The 1st Workshop on Mathematical Contributions to Metaheuristics (Matheuristics2006), Bertinoro, Italy, 2006/8/27-30.

• 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, INFORMS International Conference, Hong Kong, China, 2006/6/25-28.

• S.Umetani, A bi-directional local search for robot motion planning problem with many degrees of freedom, International Workshop on Discrete Optimization, Kyoto, Japan, 2005/12/6.

• S.Umetani, M.Yagiura, T.Imamichi, S.Imahori, K.Nonobe and T.Ibaraki, An iterated local search algorithm for irregular packing problem, IFORS Triennial 2005 Conference, Honolulu, Hawaii, US, 2005/7/11-15.

• M.Sasaki and S.Umetani, Airline network design model, International Symposium on Locational Decisions X (ISOLDE X), Sevilla-Islantilla, Spain, 2004/5/16-19.

• S.Umetani, M.Yagiura and T.Ibaraki, A variable neighborhood search for cutting stock problem with a given number of patterns, CORS/INFORMS Joint International Meeting, Banff, Canada, 2004/5/16-19.

• S.Umetani, M.Yagiura and T.Ibaraki, A local search approach to the pattern restricted 1D-CSP, The 1st Meeting of Euro Special Interest Group on Cutting and Packing (ESICUP2004), Lutherstadt Wittenberg, Germany, 2004/3/18-20.

• S.Umetani, M.Yagiura and T.Ibaraki, An LP-based local search for one dimensional cutting stock problem, EURO/INFORMS Joint International Meeting, Istanbul, Turkey, 2003/7/6/-10.

• S.Umetani, M.Yagiura and T.Ibaraki, A pattern generating heuristic for one dimensional cutting stock problem, The 17th International Symposium on Mathematical Programming (ISMP2000), Atlanta, US, 2000/8/7-11.

• S.Umetani, M.Yagiura and T.Ibaraki, Minimizing the number of different patterns in the cutting stock problem, IFORS 1999 Triennial Conference (IFORS'99), Beijing, China, 1999/8/16-20.