Affiliation

Shunji Umetani, PhD(Informatics), Associate Professor,
Department of Information and Physical Sciences, Graduate School of Information Science and Technology, Osaka University.
Address: 1-5 Yamadaoka, Suita, Osaka 565-0871, JAPAN.
Tel: +81-6-6879-7799 (direct)
E-mail: umetani@ist.osaka-u.ac.jp

News

  • 2018/1/7, Our paper has been accepted for publication in Computers and Operations Research.
    Relaxation heuristics for the set multicover problem with generalized upper bound constraints 
    [paper]
  • 2017/5/14, We have uploaded the following paper at arXiv preprint server.
    Relaxation heuristics for the set multicover problem with generalized upper bound constraints
    [paper]
  • 2017/5/12, Our paper has been accepted for publication in European Journal of Operational Research.
    Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs
    [paper]
  • 2016/3/22, Our paper has been accepted for publication in Omega, The International Journal of Management Science.
    A linear programming based heuristic algorithm for charge and discharge scheduling of electric vehicles in a building energy management system
    [paper]
  • 2015/12/8, Our paper has been accepted for publication in Journal of Natural Language Processing (in Japan).
    Sequence alignment as a set partitioning problem
  • 2014/11/17, Our paper has been accepted for publication in AAAI-15 Conference.
    Exploiting variable associations to configure efficient local search in large-scale set partitioning problems
    [paper] [supplement]

Research interest

Mathematical optimization gives us powerful solutions to tackle a wide variety of real applications with large-scale data. However, most of these problems are classified into the class of NP-hard from the view of computational complexity. Under the back ground, we are aiming to develop practical algorithms for harder and larger combinatorial optimization problems within reasonable computation time.
The current research topics are as follows:
  • Automatic algorithm configuration to improve the performance of general heuristic solvers
  • Heuristic algorithms for large-scale combinatorial optimization problems
  • Packing and cutting problems and their applications
  • Mathematical optimization models and algorithms for solving real applications