One-dimensional cutting stock problem to minimize the number of different patterns. - Shunji Umetani; Mutsunori Yagiura; Toshihide Ibaraki (Eur. J. Oper. Res., 2003)

An LP-Based Local Search to the One Dimensional Cutting Stock Problem Using a Given Number of Cutting Patterns. - Shunji Umetani; Mutsunori Yagiura; Toshihide Ibaraki (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003)

One-Dimensional Cutting Stock Problem with a Given Number of Setups: A Hybrid Approach of Metaheuristics and Linear Programming. - Shunji Umetani; Mutsunori Yagiura; Toshihide Ibaraki (J. Math. Model. Algorithms, 2006)

Diversion of Hierarchical Phrases as Reordering Templates. - Mikio Yamamoto; Jyunya Norimatsu; Mitsuru Koshikawa; Takahiro Fukutomi; Taku Nishio; Kugatsu Sadamitsu; Takehito Utsuro; Masao Utiyama; Shunji Umetani; Tomomi Matsui (NTCIR, 2008)

Solving the irregular strip packing problem via guided local search for overlap minimization. - Shunji Umetani; Mutsunori Yagiura; Shinji Imahori; Takashi Imamichi; Koji Nonobe; Toshihide Ibaraki (Int. Trans. Oper. Res., 2009)

On the one-dimensional stock cutting problem in the paper tube industry. - Kazuki Matsumoto; Shunji Umetani; Hiroshi Nagamochi (J. Sched., 2011)

A Heuristic Algorithm for the Set Multicover Problem with Generalized Upper Bound Constraints. - Shunji Umetani; Masanao Arakawa; Mutsunori Yagiura (LION, 2013)

Exploiting Variable Associations to Configure Efficient Local Search in Large-Scale Set Partitioning Problems. - Shunji Umetani (AAAI, 2015)

Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs. - Shunji Umetani (Eur. J. Oper. Res., 2017)

Relaxation heuristics for the set multicover problem with generalized upper bound constraints. - Shunji Umetani; Masanao Arakawa; Mutsunori Yagiura (Comput. Oper. Res., 2018)

An efficient branch-and-bound algorithm for submodular function maximization. - Naoya Uematsu; Shunji Umetani; Yoshinobu Kawahara (CoRR, 2018)

An Efficient Branch-and-Cut Algorithm for Approximately Submodular Function Maximization. - Naoya Uematsu; Shunji Umetani; Yoshinobu Kawahara (SMC, 2019)

Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes. - Shunji Umetani; Shohei Murakami (Eur. J. Oper. Res., 2022)

Operating Range Estimation for Price Optimization. - Shunnosuke Ikeda; Naoki Nishimura; Shunji Umetani (ICDM (Workshops), 2023)

Interpretable Price Bounds Estimation with Shape Constraints in Price Optimization. - Shunnosuke Ikeda; Naoki Nishimura; Shunji Umetani (Rev. Socionetwork Strateg., 2025)