18 citations · 45 across the 18 of their papers we have counts for
19 papers
Condorcet-type properties of the linear ordering problem with ties
Daichi Kawashima, Noriyoshi Sukegawa
The Kemeny rule aggregates multiple strict rankings into a single strict ranking that minimizes the sum of its distances from the input rankings. The resulting optimization problem…
Decomposition-Based Constructive Heuristics for the Linear Ordering Problem
Kazutoshi Ando, Tatsuya Sugimoto, Noriyoshi Sukegawa
The linear ordering problem (LOP) is a classical NP-hard combinatorial optimization problem. In this paper, we study constructive heuristics for the LOP. We propose a unified recur…
On the redundancy of transitivity constraints in the clique partitioning problem
Noriyoshi Sukegawa
In this study, we identify a class of redundant transitivity constraints in a 0-1 integer linear programming formulation of the clique partitioning problem. The transitivity constr…
Simultaneous estimation of multiple discrete unimodal distributions under stochastic order constraints
Yasuhiro Yoshida, Noriyoshi Sukegawa, Jiro Iwanaga
We study the problem of estimating multiple discrete unimodal distributions, motivated by search behavior analysis on a real-world platform. To incorporate prior knowledge of prece…
Subset Selection for Stratified Sampling in Online Controlled Experiments
Haru Momozu, Yuki Uehara, Naoki Nishimura +6
Online controlled experiments, also known as A/B testing, are the digital equivalent of randomized controlled trials for estimating the impact of marketing campaigns on website vis…
Robust personalized pricing under uncertainty of purchase probabilities
Shunnosuke Ikeda, Naoki Nishimura, Noriyoshi Sukegawa +1
This paper is concerned with personalized pricing models aimed at maximizing the expected revenues or profits for a single item. While it is essential for personalized pricing to p…
Strategic Coupon Allocation for Increasing Providers' Sales Experiences in Two-sided Marketplaces
Koya Ohashi, Sho Sekine, Deddy Jobson +4
In a two-sided marketplace, network effects are crucial for competitiveness, and platforms need to retain users through advanced customer relationship management as much as possibl…
Fast solution to the fair ranking problem using the Sinkhorn algorithm
Yuki Uehara, Shunnosuke Ikeda, Naoki Nishimura +8
In two-sided marketplaces such as online flea markets, recommender systems for providing consumers with personalized item rankings play a key role in promoting transactions between…
Container pre-marshalling problem minimizing CV@R under uncertainty of ship arrival times
Daiki Ikuma, Shunnosuke Ikeda, Noriyoshi Sukegawa +1
This paper is concerned with the container pre-marshalling problem, which involves relocating containers in the storage area so that they can be efficiently loaded onto ships witho…
Privacy-preserving recommender system using the data collaboration analysis for distributed datasets
Tomoya Yanagi, Shunnosuke Ikeda, Noriyoshi Sukegawa +1
In order to provide high-quality recommendations for users, it is desirable to share and integrate multiple datasets held by different parties. However, when sharing such distribut…
Robust portfolio optimization model for electronic coupon allocation
Yuki Uehara, Naoki Nishimura, Yilin Li +6
Currently, many e-commerce websites issue online/electronic coupons as an effective tool for promoting sales of various products and services. We focus on the problem of optimally…
Predicting Online Item-choice Behavior: A Shape-restricted Regression Perspective
Naoki Nishimura, Noriyoshi Sukegawa, Yuichi Takano +1
This paper examines the relationship between user pageview (PV) histories and their item-choice behavior on an e-commerce website. We focus on PV sequences, which represent time se…
The diameter of lattice zonotopes
Antoine Deza, Lionel Pournin, Noriyoshi Sukegawa
We establish sharp asymptotic estimates for the diameter of primitive zonotopes when their dimension is fixed. We also prove that, for infinitely many integers , the largest pos…
A Latent-class Model for Estimating Product-choice Probabilities from Clickstream Data
Naoki Nishimura, Noriyoshi Sukegawa, Yuichi Takano +1
This paper analyzes customer product-choice behavior based on the recency and frequency of each customer's page views on e-commerce sites. Recently, we devised an optimization mode…
A simple proof of tail--polynomial bounds on the diameter of polyhedra
Shinji Mizuno, Noriyoshi Sukegawa
Let denote the maximum diameter of a -dimensional polyhedron with facets. In this paper, we propose a unified analysis of a recursive inequality about esta…
Improving bounds on the diameter of a polyhedron in high dimensions
Noriyoshi Sukegawa
In 1992, Kalai and Kleitman proved that the diameter of a -dimensional polyhedron with facets is at most . In 2014, Todd improved the Kalai-Kleitman bound to…
A primal-simplex based Tardos' algorithm
Shinji Mizuno, Noriyoshi Sukegawa, Antoine Deza
In the mid-eighties Tardos proposed a strongly polynomial algorithm for solving linear programming problems for which the size of the coefficient matrix is polynomially bounded by…
Fractional programming formulation for the vertex coloring problem
Tomomi Matsui, Noriyoshi Sukegawa, Atsushi Miyauchi
We devise a new formulation for the vertex coloring problem. Different from other formulations, decision variables are associated with the pairs of vertices. Consequently, colors w…
Maximizing Barber's bipartite modularity is also hard
Atsushi Miyauchi, Noriyoshi Sukegawa
Modularity introduced by Newman and Girvan [Phys. Rev. E 69, 026113 (2004)] is a quality function for community detection. Numerous methods for modularity maximization have been de…