3 citations · 5 across the 5 of their papers we have counts for
5 papers
A 3-approximation list scheduling algorithm for a single-machine scheduling problem with a non-renewable resource and total weighted completion time criterion
Susumu Hashimoto, Shinji Mizuno
This paper studies a single-machine scheduling problem with a non-renewable resource (NR-SSP) and total weighted completion time criterion. The non-renewable resource is consumed w…
On a reduction of the weighted induced bipartite subgraph problem to the weighted independent set problem
Yotaro Takazawa, Shinji Mizuno
We study the weighted induced bipartite subgraph problem (WIBSP). The goal of WIBSP is, given a graph and nonnegative weights for the nodes, to find a set W of nodes with the maxim…
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…
Klee-Minty's LP and Upper Bounds for Dantzig's Simplex Method
Tomonari Kitahara, Shinji Mizuno
Kitahara and Mizuno (2010) get two upper bounds for the number of different basic feasible solutions generated by Dantzig's simplex method. The size of the bounds highly depends on…
A Bound for the Number of Different Basic Solutions Generated by the Simplex Method
Tomonari Kitahara, Shinji Mizuno
In this short paper, we give an upper bound for the number of different basic feasible solutions generated by the simplex method for linear programming problems having optimal solu…