Improving collaborative filtering recommendations by estimating user preferences from clickstream data J Iwanaga, N Nishimura, N Sukegawa, Y Takano Electronic Commerce Research and Applications 37, 100877, 2019 | 35 | 2019 |
A latent-class model for estimating product-choice probabilities from clickstream data N Nishimura, N Sukegawa, Y Takano, J Iwanaga Information Sciences 429, 406-420, 2018 | 35 | 2018 |
Redundant constraints in the standard formulation for the clique partitioning problem A Miyauchi, N Sukegawa Optimization Letters 9, 199-207, 2015 | 31 | 2015 |
Exact clustering via integer programming and maximum satisfiability A Miyauchi, T Sonobe, N Sukegawa Proceedings of the AAAI conference on artificial intelligence 32 (1), 2018 | 24 | 2018 |
Estimating product-choice probabilities from recency and frequency of page views J Iwanaga, N Nishimura, N Sukegawa, Y Takano Knowledge-Based Systems 99, 157-167, 2016 | 24 | 2016 |
Maximizing Barber’s bipartite modularity is also hard A Miyauchi, N Sukegawa Optimization Letters 9, 897-913, 2015 | 24 | 2015 |
Improving bounds on the diameter of a polyhedron in high dimensions N Sukegawa Discrete Mathematics 340 (9), 2134-2142, 2017 | 23 | 2017 |
An asymptotically improved upper bound on the diameter of polyhedra N Sukegawa Discrete & Computational Geometry 62, 690-699, 2019 | 19 | 2019 |
Cutting plane algorithms for mean-CVaR portfolio optimization with nonconvex transaction costs Y Takano, K Nanjo, N Sukegawa, S Mizuno Computational Management Science 12, 319-340, 2015 | 17 | 2015 |
Lagrangian relaxation and pegging test for the clique partitioning problem N Sukegawa, Y Yamamoto, L Zhang Advances in Data Analysis and Classification 7, 363-391, 2013 | 14 | 2013 |
The diameter of lattice zonotopes A Deza, L Pournin, N Sukegawa Proceedings of the American Mathematical Society 148 (8), 3507-3516, 2020 | 11 | 2020 |
Preference profiles determining the proposals in the Gale–Shapley algorithm for stable matching problems N Sukegawa, Y Yamamoto Japan journal of industrial and applied mathematics 29 (3), 547-560, 2012 | 9 | 2012 |
Fractional programming formulation for the vertex coloring problem T Matsui, N Sukegawa, A Miyauchi Information Processing Letters 114 (12), 706-709, 2014 | 8 | 2014 |
A refinement of Todd’s bound for the diameter of a polyhedron N Sukegawa, T Kitahara Operations Research Letters 43 (5), 534-536, 2015 | 7 | 2015 |
Predicting online item-choice behavior: A shape-restricted regression approach N Nishimura, N Sukegawa, Y Takano, J Iwanaga Algorithms 16 (9), 415, 2023 | 6 | 2023 |
A primal-simplex based Tardos’ algorithm S Mizuno, N Sukegawa, A Deza Operations Research Letters 43 (6), 625-628, 2015 | 6 | 2015 |
Prescriptive price optimization using optimal regression trees S Ikeda, N Nishimura, N Sukegawa, Y Takano Operations Research Perspectives 11, 100290, 2023 | 5 | 2023 |
Two efficient calculations of edit distance between marked point processes Y Hirata, N Sukegawa Chaos: An Interdisciplinary Journal of Nonlinear Science 29 (10), 2019 | 5 | 2019 |
A note on the complexity of the maximum edge clique partitioning problem with respect to the clique number. N Sukegawa, A Miyauchi Discret. Optim. 10 (4), 331-332, 2013 | 5 | 2013 |
Lagrangian relaxation and pegging test for linear ordering problems N Sukegawa, Y Yamamoto, L Zhang Journal of the Operations Research Society of Japan 54 (4), 142-160, 2011 | 5 | 2011 |