Shunji Umetani

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 12

Top Topics

Integer Program

Shape Constraints

Packing Problem

Arbitrarily Shaped

Top Venues

Eur. J. Oper. Res.

Comput. Oper. Res.

Publications

Shunnosuke Ikeda, Naoki Nishimura, Shunji Umetani
Interpretable Price Bounds Estimation with Shape Constraints in Price Optimization. CoRR (2024)
Shunnosuke Ikeda, Naoki Nishimura, Shunji Umetani
Operating Range Estimation for Price Optimization. ICDM (Workshops) (2023)
Shunji Umetani, Shohei Murakami
Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes. Eur. J. Oper. Res. 303 (3) (2022)
Shunji Umetani, Shohei Murakami
Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes. CoRR (2021)
Naoya Uematsu, Shunji Umetani, Yoshinobu Kawahara
An efficient branch-and-cut algorithm for approximately submodular function maximization. CoRR (2019)
Naoya Uematsu, Shunji Umetani, Yoshinobu Kawahara
An Efficient Branch-and-Cut Algorithm for Approximately Submodular Function Maximization. SMC (2019)
Naoya Uematsu, Shunji Umetani, Yoshinobu Kawahara
An efficient branch-and-bound algorithm for submodular function maximization. CoRR (2018)
Shunji Umetani, Masanao Arakawa, Mutsunori Yagiura
Relaxation heuristics for the set multicover problem with generalized upper bound constraints. Comput. Oper. Res. 93 (2018)
Shunji Umetani
Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs. Eur. J. Oper. Res. 263 (1) (2017)
Shunji Umetani, Masanao Arakawa, Mutsunori Yagiura
Relaxation heuristics for the set multicover problem with generalized upper bound constraints. CoRR (2017)
Shunji Umetani
Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs. CoRR (2016)
Shunji Umetani
Exploiting Variable Associations to Configure Efficient Local Search in Large-Scale Set Partitioning Problems. AAAI (2015)
Shunji Umetani, Masanao Arakawa, Mutsunori Yagiura
A Heuristic Algorithm for the Set Multicover Problem with Generalized Upper Bound Constraints. LION (2013)
Kazuki Matsumoto, Shunji Umetani, Hiroshi Nagamochi
On the one-dimensional stock cutting problem in the paper tube industry. J. Sched. 14 (3) (2011)
Shunji Umetani, Mutsunori Yagiura, Shinji Imahori, Takashi Imamichi, Koji Nonobe, Toshihide Ibaraki
Solving the irregular strip packing problem via guided local search for overlap minimization. Int. Trans. Oper. Res. 16 (6) (2009)
Mikio Yamamoto, Jyunya Norimatsu, Mitsuru Koshikawa, Takahiro Fukutomi, Taku Nishio, Kugatsu Sadamitsu, Takehito Utsuro, Masao Utiyama, Shunji Umetani, Tomomi Matsui
Diversion of Hierarchical Phrases as Reordering Templates. NTCIR (2008)
Shunji Umetani, Mutsunori Yagiura, Toshihide Ibaraki
One-Dimensional Cutting Stock Problem with a Given Number of Setups: A Hybrid Approach of Metaheuristics and Linear Programming. J. Math. Model. Algorithms 5 (1) (2006)
Shunji Umetani, Mutsunori Yagiura, Toshihide Ibaraki
One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming. Hybrid Metaheuristics (2004)
Shunji Umetani, Mutsunori Yagiura, Toshihide Ibaraki
An LP-Based Local Search to the One Dimensional Cutting Stock Problem Using a Given Number of Cutting Patterns. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (5) (2003)
Shunji Umetani, Mutsunori Yagiura, Toshihide Ibaraki
One-dimensional cutting stock problem to minimize the number of different patterns. Eur. J. Oper. Res. 146 (2) (2003)