Shunji Umetani

22 papers A* 1B 1Journal 16Unranked 4
YearRankTypeTitle / Venue / Authors
2025 J jnl
Image-free estimation of cell locations and types in spatial transcriptomics via quadtree partitioning and probabilistic clustering.
Briefings Bioinform.
Hibiki Sugiyama, Hironori Shigeta, Shunji Umetani, Shigeto Seno
2025 J jnl
Interpretable Price Bounds Estimation with Shape Constraints in Price Optimization.
Rev. Socionetwork Strateg.
Shunnosuke Ikeda, Naoki Nishimura, Shunji Umetani
2024 J jnl
Interpretable Price Bounds Estimation with Shape Constraints in Price Optimization.
CoRR
Shunnosuke Ikeda, Naoki Nishimura, Shunji Umetani
2023 — conf
Operating Range Estimation for Price Optimization.
ICDM (Workshops)
Shunnosuke Ikeda, Naoki Nishimura, Shunji Umetani
2022 J jnl
Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes.
Eur. J. Oper. Res.
Shunji Umetani, Shohei Murakami
2021 J jnl
Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes.
CoRR
Shunji Umetani, Shohei Murakami
2019 B conf
An Efficient Branch-and-Cut Algorithm for Approximately Submodular Function Maximization.
SMC
Naoya Uematsu, Shunji Umetani, Yoshinobu Kawahara
2019 J jnl
An efficient branch-and-cut algorithm for approximately submodular function maximization.
CoRR
Naoya Uematsu, Shunji Umetani, Yoshinobu Kawahara
2018 J jnl
An efficient branch-and-bound algorithm for submodular function maximization.
CoRR
Naoya Uematsu, Shunji Umetani, Yoshinobu Kawahara
2018 J jnl
Relaxation heuristics for the set multicover problem with generalized upper bound constraints.
Comput. Oper. Res.
Shunji Umetani, Masanao Arakawa, Mutsunori Yagiura
2017 J jnl
Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs.
Eur. J. Oper. Res.
Shunji Umetani
2017 J jnl
Relaxation heuristics for the set multicover problem with generalized upper bound constraints.
CoRR
Shunji Umetani, Masanao Arakawa, Mutsunori Yagiura
2016 J jnl
Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs.
CoRR
Shunji Umetani
2015 A* conf
Exploiting Variable Associations to Configure Efficient Local Search in Large-Scale Set Partitioning Problems.
AAAI
Shunji Umetani
2013 — conf
A Heuristic Algorithm for the Set Multicover Problem with Generalized Upper Bound Constraints.
LION
Shunji Umetani, Masanao Arakawa, Mutsunori Yagiura
2011 J jnl
On the one-dimensional stock cutting problem in the paper tube industry.
J. Sched.
Kazuki Matsumoto, Shunji Umetani, Hiroshi Nagamochi
2009 J jnl
Solving the irregular strip packing problem via guided local search for overlap minimization.
Int. Trans. Oper. Res.
Shunji Umetani, Mutsunori Yagiura, Shinji Imahori, Takashi Imamichi, Koji Nonobe, Toshihide Ibaraki
2008 — conf
Diversion of Hierarchical Phrases as Reordering Templates.
NTCIR
Mikio Yamamoto, Jyunya Norimatsu, Mitsuru Koshikawa, Takahiro Fukutomi, Taku Nishio, Kugatsu Sadamitsu, Takehito Utsuro, Masao Utiyama, Shunji Umetani, Tomomi Matsui
2006 J jnl
One-Dimensional Cutting Stock Problem with a Given Number of Setups: A Hybrid Approach of Metaheuristics and Linear Programming.
J. Math. Model. Algorithms
Shunji Umetani, Mutsunori Yagiura, Toshihide Ibaraki
2004 — conf
One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming.
Hybrid Metaheuristics
Shunji Umetani, Mutsunori Yagiura, Toshihide Ibaraki
2003 J jnl
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.
Shunji Umetani, Mutsunori Yagiura, Toshihide Ibaraki
2003 J jnl
One-dimensional cutting stock problem to minimize the number of different patterns.
Eur. J. Oper. Res.
Shunji Umetani, Mutsunori Yagiura, Toshihide Ibaraki