Abstract
In a bag-packing problem, it is important to determine which items are to be put in a bag in order to make the pack weigh the given desired weight. An algorithm is developed that can enumerate candidate solutions effectively. In some cases, it may be that none of solution proposals to the problem achieves a weight satisfactorily close enough to the desired standard. In such cases, although all the items for the present must be dumped according to the conventional way, one proposed the policy in which a single item is dumped. Using the proposed policy, the total number of dumping items is reduced.
