18 citations · 45 across the 18 of their papers we have counts for
8 papers · 1 filter
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…
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…
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…
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…