@article{oai:kansai-u.repo.nii.ac.jp:00011769,
 author = {Murakami, Yoshihiro and Kurata, Junichi and Uchiyama, Hironobu and Marquardt, Wolfgang},
 journal = {関西大学工学研究報告 = Technology reports of the Kansai University},
 month = {Mar},
 note = {When several items having different weights are packed into a bag, the sum weight of each packed bag needs to be constant. The problem at packing is how to determine the items to be included in a bag so that the sum weight should be closest to the desired weight. In this paper, the following two algorithms are shown; one is to solve as an optimization problem and the other is to solve as a constraint satisfaction problem. Comparing the two algorithms, their functional rolls are made clear. In order to reduce the number of items remaining in scale hoppers for a long time, a method is proposed in which each of the two algorithms can be turned over one after another. Simulation results seem to prove that the proposed method is preferable.},
 pages = {1--10},
 title = {Reducing the Number of Long-term Items : Optimal Strategy for a Bag-packing Problem},
 volume = {47},
 year = {2005}
}