Personal History

Name: YAGIURA, Mutsunori

Nationality: Japanese

Education:

• 1991. B.S., Department of Applied Mathematics and Physics, Faculty of Engineering, Kyoto University
• 1993. M.S., Department of Applied Mathematics and Physics, Graduate School of Engineering, Kyoto University
• 1999. Ph.D. in Engineering, Kyoto University

Academic Degree: Doctor of Engineering (Kyoto University)

Employment:

• 1994. Assistant Professor, Department of Applied Mathematics and Physics, Faculty of Engineering, Kyoto University
• 1996. Assistant Professor, Department of Applied Mathematics and Physics, Graduate School of Engineering, Kyoto University
• 1998. Assistant Professor, Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University
• 2000. Associate Professor (Lecturer), Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University
• 2005. Associate Professor, Department of Computer Science and Mathematical Informatics, Graduate School of Information Science, Nagoya University
• 2011. Professor, Department of Computer Science and Mathematical Informatics, Graduate School of Information Science, Nagoya University
• 2017. Professor, Department of Mathematical Informatics, Graduate School of Informatics, Nagoya University

Visiting Researcher: April 2001-March 2002. University of Colorado at Boulder, USA

Areas of Interest:

• Combinatorial Optimization
• Metaheuristics
• Operations Research

Academic Membership:

• INFORMS
• ACM
• Operations Research Society of Japan (Fellow)
• Information Processing Society of Japan
• The Institute of Electronics, Information and Communication Engineers of Japan
• Scheduling Society of Japan

Awards:

• SCI2003: the best paper presented in the session: Mathematical, Optimization, Simulation and Modeling. Awarded paper: S. Imahori, M. Yagiura, S. Umetani, S. Adachi and T. Ibaraki, Local search algorithms for the two dimensional cutting stock problem, Proceedings of the 7th world multiconference on systemics, cybernetics and informatics, Volume IX, 2003, pp. 334-339.
• The best paper award from the Operations Research Society of Japan, 2005. Awarded paper: An Ejection Chain Approach for the Generalized Assignment Problem, INFORMS Journal on Computing, 16 (2004) 133-151. trophy.
• The best paper award for scheduling theory from the Scheduling Society of Japan, 2006. Awarded paper: M. Kenmochi, T. Imamichi, K. Nonobe, M. Yagiura, H. Nagamochi, Exact algorithms for two-dimensional strip packing problems (in Japanese). with Mr. Kenmochi (right).
• FIT 2007 paper award. Awarded paper: X. Xie, M. Yagiura, T. Ono and T. Hirata, Analysis of an Edge Coloring Algorithm Using Chernoff Bounds, Information Technology Letters, 6 (2007) 13-16. testimonial, with Dr. Hirata (left), Dr. Xie (2nd from right), and Dr. Ono (right).
• LION II best paper award. (Awarded paper: T. Ono, M. Yagiura and T. Hirata, A vector assignment approach for the graph coloring problem, Proc. Learning and Intelligent OptimizatioN Conference (LION 2007 II), Trento, Italy, December 8-12, 2007; LNCS 5313, pp.167-176, 2008.) ceremony 1, ceremony 2, with Dr. Hirata (left) and Dr. Ono (middle).
• ISS 2009 best paper award for scheduling practice. Awarded paper: D. Kimoto, M. Yagiura, T. Ono and T. Hirata, An adaptive memory Lagrangian heuristic algorithm for the multicut problem, Proc. International Symposium on Scheduling (ISS 2009), Nagoya, Japan, July 4-6, 2009, pp.215-223. with Mr. Kimoto (right).
• FIT 2009 paper award. Awarded paper: Y. Tanaka, M. Sasaki, M. Yagiura, An LP-Based Heuristic Algorithm for the Node Capacitated In-Tree Packing Problem. with Dr. Sasaki (left) and Mr. Tanaka (middle).
• The best paper award for scheduling theory from the Scheduling Society of Japan (SSJ), 2009. Awarded paper: S. Imahori, M. Yagiura, A practical heuristics for the rectangular strip packing problem. ceremony, with Dr. Imaori (left).
• Discrete Optimization Top Cited Article 2005-2010, 2010. Awarded paper: H. Hashimoto, M. Yagiura and T. Ibaraki, An Iterated Local Search Algorithm for the Time-Dependent Vehicle Routing Problem with Time Windows, Discrete Optimization, 5 (2008) 434-456. testimonial.
• The best paper award for scheduling theory from the Scheduling Society of Japan (SSJ), 2010. Awarded paper: H. Hashimoto, M. Yagiura, An LP-based algorithm for scheduling preemptive and/or non-preemptive real-time tasks. President of SSJ (left) and Dr. Hashimoto (right).
• ISS 2013 best paper award for scheduling theory, Awarded paper: Y. Hu, H. Hashimoto, S. Imahori and M. Yagiura, Efficient construction heuristic algorithms for the rectilinear block packing problem, Proc. International Symposium on Scheduling (ISS 2013), Tokyo, Japan, July 18-20, 2013, pp. 80-85. ceremony, testimonial, testimonial.
• Outstanding Paper Award, Awarded paper: W. Wu, M. Iori, S. Martello and M. Yagiura, Algorithms for the min-max regret generalized assignment problem with interval data, Proceedings of the IEEE International Conference on Industrial Engineering and Engineering Management (IEEM), Selangor, Malaysia, December 9-12, 2014, ceremony, testimonial, WU, Wei.
• Third Prize, Challenge ESICUP 2015 - Container Loading, Short Runtime Competition, team_9 (H. Iwasawa, Y. Hu, H. Hashimoto, S. Imahori, M. Yagiura), ESICUP Meeting, Portsumouth, UK, March 29-31, 2015, ceremony, ceremony, ceremony.
• ISS 2015 best paper award for scheduling practice, Awarded paper: W. Wu, Y. Hu, H. Hashimoto, T. Ando, T. Shiraki and M. Yagiura, A heuristic algorithm for the crew pairing problem in airline scheduling, Proc. International Symposium on Scheduling (ISS 2015), Kobe, Japan, July 4-6, 2015, pp. 121-128. ceremony, ceremony, ceremony, after ceremony, after ceremony, after ceremony, testimonial.
• The Best Paper of the Year awarded from the Operations Research Society of Japan, September 2015. Awarded paper: S. Imahori, Y. Chien, Y. Tanaka and M. Yagiura, Enumerating bottom-left stable positions for rectangle placements with overlap, Journal of the Operations Research Society of Japan, 57 (2014) 45-61. ceremony, after ceremony, medal, testimonial.
• The best paper award for scheduling theory from the Scheduling Society of Japan (SSJ), 2015. Awarded paper: W. Wu, M. Iori, S. Martello, M. Yagiura, Heuristic and Exact Algorithms for the Generalized Assignment Problem under the Min-Max Regret Criterion (in Japanese). testimonial, testimonial.
• The best paper award for scheduling theory from the Scheduling Society of Japan (SSJ), 2016. Awarded paper: Y. Sawai, Y. Hu, W. Wu, H. Hashimoto, M. Kato, T. Saito, M. Yagiura, A column generation approach for the bus crew scheduling problem (in Japanese). testimonial, after ceremony, after ceremony
• ISS 2017 best paper award for scheduling theory. Awarded paper: Y. Takeuchi, Y. Takada, Y. Hu, H. Hashimoto and M. Yagiura, Efficient implementations of an iterated local search algorithm for the multi-vehicle covering tour problem, Proceedings of the International Symposium on Scheduling (ISS 2017), Nagoya, Japan, June 23-25, pp. 79-86, 2017. testimonial, Organizing Committee Chair of ISS and Yosuke Takada, authors at the ceremony.
• The best paper award for scheduling theory from the Scheduling Society of Japan (SSJ), 2017. Awarded paper: M. Ito, W. Wu, Y. Hu, H. Goko, M. Sasaki and M. Yagiura, Online product shipping using heuristic algorithms based on column generation. ceremony, testimonial, testimonial, Mayu Ito, authors, authors with President of SSJ, Mayu with President of SSJ.
• The Best Paper of the Year awarded from the Operations Research Society of Japan, September 2019. Awarded paper: Y. Hu, S. Fukatsu, H. Hashimoto, S. Imahori and M. Yagiura, Efficient Overlap Detection and Construction Algorithms for the Bitmap Shape Packing Problem, Journal of the Operations Research Society of Japan, 61 (2018) 132-150. ceremony, medal, medal.
• The best paper award for scheduling practice from the Scheduling Society of Japan (SSJ), 2020. Awarded paper: T. Sugiura, T. Takada, Y. Hu, H. Hashimoto and M. Yagiura, A heuristic algorithm for the commuting bus routing problem with latest arrival time constraint.
• ISS 2021 best paper award for scheduling theory, Awarded paper: W. Wu, J. Zhang, Y. Hu and M. Yagiura, A heuristic dynamic programming method for the robust knapsack problem, Proceedings of the International Symposium on Scheduling (ISS 2021), virtual, June 25-27, pp. 141-146, 2021. Prof. Wu, testimonial.

Other Facts:

• Erdős number: According to MathSciNet site, my Erdős number is 3. Some coauthors of mine, e.g., Endre Boros, Fred Glover, Takeaki Uno, Uri Zwick, have Erdős number 2.

Further Information: My homepage