#### Filter Results:

- Full text PDF available (3)

#### Publication Year

1976

2009

#### Publication Type

#### Co-author

#### Publication Venue

Learn More

- Naoki Katoh, Toshihide Ibaraki, Hisashi Mine
- SIAM J. Comput.
- 1981

- Naoki Katoh, Toshihide Ibaraki, Hisashi Mine
- Networks
- 1982

- Hiroaki Ishii, Toshihide Ibaraki, Hisashi Mine
- Math. Program.
- 1977

- Hiroshi Kise, Toshihide Ibaraki, Hisashi Mine
- Operations Research
- 1978

- Naoki Katoh, Toshihide Ibaraki, Hisashi Mine
- J. ACM
- 1981

An algorithm is presented for obtaining the K best solutions of the resource allocauon problem with an objective function which is the sum of convex functions of one variable It requires O(T* + Klog K + Kn~ogn) time and O(Kn~ogn + n) space, where n is the number of variables and T* ~s the computatmnal time to obtain the best solution

- HISASHI MINE, HAJIME KAWAI
- 2009

Marginal checking of a Markovian degradation unit is treated when time interval to the next checking is not fixed but obeys a certain general distribution. The problem of determing the optimal set of the states at which the unit is replaced with a new one (marginal set) is discussed. It is solved by using Markov-renewal programming with modified policy… (More)

- Naoki Katoh, Toshihide Ibaraki, Hisashi Mine
- Math. Oper. Res.
- 1985

This paper is concerned with a differentiable exact penalty function derived by modifying the Wolfe dual of an equality constrained problem. It may be considered that this penalty function belongs to a class of general augmented Lagrangians on which other differentiable exact penalty functions are based. It is shown that this penalty function possesses an… (More)

- Hisashi Mine, Katsuhisa Ohno, Takatsugu Koizumi
- Operations Research
- 1976

This paper deals with a problem of assigning n persons to n nodes (jobs) in a given network, whose arc lengths are dependent upon the assignment, so that the length of a critical path in the network may be minimized. The problem is first formulated as an integer programming probem, and then a branch-and-bound algorithm is proposed. The algorithm makes use… (More)