default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNoriyoshi Sukegawa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j20]Yuki Uehara, Naoki Nishimura, Yilin Li, Jie Yang, Deddy Jobson, Koya Ohashi, Takeshi Matsumoto, Noriyoshi Sukegawa
, Yuichi Takano:
Robust portfolio optimization model for electronic coupon allocation. INFOR Inf. Syst. Oper. Res. 62(4): 646-660 (2024)- [j19]Noriyoshi Sukegawa, Shohei Suzuki, Yoshiko Ikebe, Yoshito Hirata:
On Computing Medians of Marked Point Process Data Under Edit Distance. J. Optim. Theory Appl. 200(1): 178-193 (2024) - [c3]Yuki Uehara, Shunnosuke Ikeda, Naoki Nishimura, Koya Ohashi, Yilin Li, Jie Yang, Deddy Jobson, Xingxia Zha, Takeshi Matsumoto, Noriyoshi Sukegawa, Yuichi Takano:
Fast Solution to the Fair Ranking Problem Using the Sinkhorn Algorithm. PRICAI (5) 2024: 207-215 - [i10]Yuki Uehara, Naoki Nishimura, Yilin Li, Jie Yang, Deddy Jobson, Koya Ohashi, Takeshi Matsumoto, Noriyoshi Sukegawa, Yuichi Takano:
Robust portfolio optimization model for electronic coupon allocation. CoRR abs/2405.12865 (2024) - [i9]Daiki Ikuma, Shunnosuke Ikeda, Noriyoshi Sukegawa, Yuichi Takano:
Container pre-marshalling problem minimizing CV@R under uncertainty of ship arrival times. CoRR abs/2405.17576 (2024) - [i8]Tomoya Yanagi, Shunnosuke Ikeda, Noriyoshi Sukegawa, Yuichi Takano:
Privacy-preserving recommender system using the data collaboration analysis for distributed datasets. CoRR abs/2406.01603 (2024) - [i7]Yuki Uehara, Shunnosuke Ikeda, Naoki Nishimura, Koya Ohashi, Yilin Li, Jie Yang, Deddy Jobson, Xingxia Zha, Takeshi Matsumoto, Noriyoshi Sukegawa, Yuichi Takano:
Fast solution to the fair ranking problem using the Sinkhorn algorithm. CoRR abs/2406.10262 (2024) - [i6]Koya Ohashi, Sho Sekine, Deddy Jobson, Jie Yang, Naoki Nishimura, Noriyoshi Sukegawa, Yuichi Takano:
Strategic Coupon Allocation for Increasing Providers' Sales Experiences in Two-sided Marketplaces. CoRR abs/2407.14895 (2024) - [i5]Shunnosuke Ikeda, Naoki Nishimura, Noriyoshi Sukegawa, Yuichi Takano:
Robust personalized pricing under uncertainty of purchase probabilities. CoRR abs/2407.15332 (2024) - 2023
- [j18]Naoki Nishimura, Noriyoshi Sukegawa, Yuichi Takano, Jiro Iwanaga:
Predicting Online Item-Choice Behavior: A Shape-Restricted Regression Approach. Algorithms 16(9): 415 (2023) - [j17]Yasuko Matsui, Noriyoshi Sukegawa, Ping Zhan:
Monotone Diameter of Bisubmodular Polyhedra. Oper. Res. Forum 4(4): 76 (2023) - 2021
- [j16]Yuya Higashikawa, Keiko Imai, Takeharu Shiraga, Noriyoshi Sukegawa, Yusuke Yokosuka:
Minimum point-overlap labelling. Optim. Methods Softw. 36(2-3): 316-325 (2021) - 2020
- [j15]Antoine Deza, Tomonari Kitahara, Noriyoshi Sukegawa:
Preface: Workshop on Advances in Optimization. Discret. Appl. Math. 275: 1-2 (2020) - [i4]Naoki Nishimura, Noriyoshi Sukegawa, Yuichi Takano, Jiro Iwanaga:
Predicting Online Item-choice Behavior: A Shape-restricted Regression Perspective. CoRR abs/2004.08519 (2020)
2010 – 2019
- 2019
- [j14]Tomonari Kitahara, Noriyoshi Sukegawa:
A Simple Projection Algorithm for Linear Programming Problems. Algorithmica 81(1): 167-178 (2019) - [j13]Noriyoshi Sukegawa:
An Asymptotically Improved Upper Bound on the Diameter of Polyhedra. Discret. Comput. Geom. 62(3): 690-699 (2019) - [j12]Jiro Iwanaga, Naoki Nishimura, Noriyoshi Sukegawa, Yuichi Takano:
Improving collaborative filtering recommendations by estimating user preferences from clickstream data. Electron. Commer. Res. Appl. 37 (2019) - 2018
- [j11]Naoki Nishimura, Noriyoshi Sukegawa, Yuichi Takano, Jiro Iwanaga:
A latent-class model for estimating product-choice probabilities from clickstream data. Inf. Sci. 429: 406-420 (2018) - [c2]Atsushi Miyauchi, Tomohiro Sonobe, Noriyoshi Sukegawa:
Exact Clustering via Integer Programming and Maximum Satisfiability. AAAI 2018: 1387-1394 - 2017
- [j10]Noriyoshi Sukegawa:
Improving bounds on the diameter of a polyhedron in high dimensions. Discret. Math. 340(9): 2134-2142 (2017) - [c1]Yuya Higashikawa, Keiko Imai, Yusuke Matsumoto, Noriyoshi Sukegawa, Yusuke Yokosuka:
Minimum Point-Overlap Labeling. CIAC 2017: 334-344 - 2016
- [j9]Jiro Iwanaga, Naoki Nishimura, Noriyoshi Sukegawa, Yuichi Takano:
Estimating product-choice probabilities from recency and frequency of page views. Knowl. Based Syst. 99: 157-167 (2016) - [i3]Naoki Nishimura, Noriyoshi Sukegawa, Yuichi Takano, Jiro Iwanaga:
A Latent-class Model for Estimating Product-choice Probabilities from Clickstream Data. CoRR abs/1612.06589 (2016) - 2015
- [j8]Yuichi Takano, Keisuke Nanjo, Noriyoshi Sukegawa, Shinji Mizuno:
Cutting plane algorithms for mean-CVaR portfolio optimization with nonconvex transaction costs. Comput. Manag. Sci. 12(2): 319-340 (2015) - [j7]Atsushi Miyauchi, Noriyoshi Sukegawa:
Redundant constraints in the standard formulation for the clique partitioning problem. Optim. Lett. 9(1): 199-207 (2015) - [j6]Atsushi Miyauchi, Noriyoshi Sukegawa:
Maximizing Barber's bipartite modularity is also hard. Optim. Lett. 9(5): 897-913 (2015) - [j5]Noriyoshi Sukegawa, Tomonari Kitahara:
A refinement of Todd's bound for the diameter of a polyhedron. Oper. Res. Lett. 43(5): 534-536 (2015) - [j4]Shinji Mizuno, Noriyoshi Sukegawa, Antoine Deza:
A primal-simplex based Tardos' algorithm. Oper. Res. Lett. 43(6): 625-628 (2015) - 2014
- [j3]Tomomi Matsui, Noriyoshi Sukegawa, Atsushi Miyauchi:
Fractional programming formulation for the vertex coloring problem. Inf. Process. Lett. 114(12): 706-709 (2014) - [i2]Tomomi Matsui, Noriyoshi Sukegawa, Atsushi Miyauchi:
Fractional programming formulation for the vertex coloring problem. CoRR abs/1402.5769 (2014) - 2013
- [j2]Noriyoshi Sukegawa, Yoshitsugu Yamamoto, Liyuan Zhang:
Lagrangian relaxation and pegging test for the clique partitioning problem. Adv. Data Anal. Classif. 7(4): 363-391 (2013) - [j1]Noriyoshi Sukegawa, Atsushi Miyauchi:
A note on the complexity of the maximum edge clique partitioning problem with respect to the clique number. Discret. Optim. 10(4): 331-332 (2013) - [i1]Atsushi Miyauchi, Noriyoshi Sukegawa:
Maximizing Barber's bipartite modularity is also hard. CoRR abs/1310.4656 (2013)
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 2025-01-20 22:55 CET 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:
