default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShunji Umetani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i6]Shunnosuke Ikeda, Naoki Nishimura, Shunji Umetani:
Interpretable Price Bounds Estimation with Shape Constraints in Price Optimization. CoRR abs/2405.14909 (2024)- 2023
- [c6]Shunnosuke Ikeda, Naoki Nishimura, Shunji Umetani:
Operating Range Estimation for Price Optimization. ICDM (Workshops) 2023: 31-36 - 2022
- [j8]Shunji Umetani
, Shohei Murakami:
Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes. Eur. J. Oper. Res. 303(3): 1009-1026 (2022) - 2021
- [i5]Shunji Umetani, Shohei Murakami:
Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes. CoRR abs/2104.04525 (2021)
2010 – 2019
- 2019
- [c5]Naoya Uematsu, Shunji Umetani, Yoshinobu Kawahara:
An Efficient Branch-and-Cut Algorithm for Approximately Submodular Function Maximization. SMC 2019: 3160-3167 - [i4]Naoya Uematsu, Shunji Umetani, Yoshinobu Kawahara:
An efficient branch-and-cut algorithm for approximately submodular function maximization. CoRR abs/1904.12682 (2019) - 2018
- [j7]Shunji Umetani, Masanao Arakawa, Mutsunori Yagiura:
Relaxation heuristics for the set multicover problem with generalized upper bound constraints. Comput. Oper. Res. 93: 90-100 (2018) - [i3]Naoya Uematsu, Shunji Umetani, Yoshinobu Kawahara:
An efficient branch-and-bound algorithm for submodular function maximization. CoRR abs/1811.04177 (2018) - 2017
- [j6]Shunji Umetani:
Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs. Eur. J. Oper. Res. 263(1): 72-81 (2017) - [i2]Shunji Umetani, Masanao Arakawa, Mutsunori Yagiura:
Relaxation heuristics for the set multicover problem with generalized upper bound constraints. CoRR abs/1705.04970 (2017) - 2016
- [i1]Shunji Umetani:
Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs. CoRR abs/1604.08448 (2016) - 2015
- [c4]Shunji Umetani:
Exploiting Variable Associations to Configure Efficient Local Search in Large-Scale Set Partitioning Problems. AAAI 2015: 1226-1232 - 2013
- [c3]Shunji Umetani, Masanao Arakawa, Mutsunori Yagiura:
A Heuristic Algorithm for the Set Multicover Problem with Generalized Upper Bound Constraints. LION 2013: 75-80 - 2011
- [j5]Kazuki Matsumoto, Shunji Umetani, Hiroshi Nagamochi:
On the one-dimensional stock cutting problem in the paper tube industry. J. Sched. 14(3): 281-290 (2011)
2000 – 2009
- 2009
- [j4]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): 661-683 (2009) - 2008
- [c2]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 - 2006
- [j3]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): 43-64 (2006) - 2004
- [c1]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: 101-114 - 2003
- [j2]Shunji Umetani, Mutsunori Yagiura, Toshihide Ibaraki:
One-dimensional cutting stock problem to minimize the number of different patterns. Eur. J. Oper. Res. 146(2): 388-402 (2003) - [j1]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. 86-A(5): 1093-1102 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
