Follow
Noriyoshi Sukegawa
Title
Cited by
Cited by
Year
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
272018
Redundant constraints in the standard formulation for the clique partitioning problem
A Miyauchi, N Sukegawa
Optimization Letters 9 (1), 199-207, 2015
272015
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
222019
Improving bounds on the diameter of a polyhedron in high dimensions
N Sukegawa
Discrete Mathematics 340 (9), 2134-2142, 2017
202017
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
192016
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
182018
Maximizing Barber’s bipartite modularity is also hard
A Miyauchi, N Sukegawa
Optimization Letters 9 (5), 897-913, 2015
182015
An asymptotically improved upper bound on the diameter of polyhedra
N Sukegawa
Discrete & Computational Geometry 62 (3), 690-699, 2019
142019
Lagrangian relaxation and pegging test for the clique partitioning problem
N Sukegawa, Y Yamamoto, L Zhang
Advances in Data Analysis and Classification 7 (4), 363-391, 2013
142013
Cutting plane algorithms for mean-CVaR portfolio optimization with nonconvex transaction costs
Y Takano, K Nanjo, N Sukegawa, S Mizuno
Computational Management Science 12 (2), 319-340, 2015
132015
The diameter of lattice zonotopes
A Deza, L Pournin, N Sukegawa
Proceedings of the American Mathematical Society 148 (8), 3507-3516, 2020
102020
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
92012
A refinement of Todd’s bound for the diameter of a polyhedron
N Sukegawa, T Kitahara
Operations Research Letters 43 (5), 534-536, 2015
72015
Fractional programming formulation for the vertex coloring problem
T Matsui, N Sukegawa, A Miyauchi
Information Processing Letters 114 (12), 706-709, 2014
62014
A primal-simplex based Tardos’ algorithm
S Mizuno, N Sukegawa, A Deza
Operations Research Letters 43 (6), 625-628, 2015
52015
LAGRANGIAN RELAXATION AND PEGGING TEST FOR LINEAR ORDERING PROBLEMS (< Special Issue> SCOPE (Seminar on Computation and OPtimization for new Extensions))
N Sukegawa, Y Yamamoto, L Zhang
Journal of the Operations Research Society of Japan 54 (4), 142-160, 2011
52011
A simple projection algorithm for linear programming problems
T Kitahara, N Sukegawa
Algorithmica 81 (1), 167-178, 2019
42019
Predicting online item-choice behavior: A shape-restricted regression approach
N Nishimura, N Sukegawa, Y Takano, J Iwanaga
22020
Two efficient calculations of edit distance between marked point processes
Y Hirata, N Sukegawa
Chaos: An Interdisciplinary Journal of Nonlinear Science 29 (10), 101107, 2019
22019
Minimum point-overlap labeling
Y Higashikawa, K Imai, Y Matsumoto, N Sukegawa, Y Yokosuka
International Conference on Algorithms and Complexity, 334-344, 2017
22017
The system can't perform the operation now. Try again later.
Articles 1–20