On the Solution Procedure for Subproblems in Partially Identifying Approximation Method

Manabu TAKEMURA; Shigeo TANAKA; Hidenori HASHIGUCHI; Katsuaki ONOGI; Yoshiyuki NISHIMURA

doi:10.9746/sicetr1965.31.682

Manabu TAKEMURA, Shigeo TANAKA, Hidenori HASHIGUCHI, Katsuaki ONOGI, Yoshiyuki NISHIMURA

Author information

Keywords: partially identifying approximation, heuristic algorithm, allowance method, knapsack problem

JOURNAL FREE ACCESS

1995 Volume 31 Issue 5 Pages 682-684

DOI https://doi.org/10.9746/sicetr1965.31.682

Details

Abstract

We proposed a heuristic algorithm for combinatorial optimization problems using partially identifying approximation. However, if the original problem is large, we must use approximation methods in it. This paper discusses the effects of the use of approximation methods on the effectiveness of this method.

Corresponding author

Register with J-STAGE for free!