@article{oai:barrel.repo.nii.ac.jp:00000184,
 author = {Iida, Hiroshi},
 issue = {1},
 journal = {商学討究},
 month = {Jul},
 note = {This piece picks up E-kKP as a knapsack problem in relation to the conventional and the simplest 2-approximation algorithm for the 0-1 knapsack problem. Taking account of the similarity between E-kKP and the multiple-choice knapsack problem, we mention how to produce two candidates onto the conventional and also how to obtain an optimal solution of LP-relaxed E-kKP that we require so as to produce the two candidates., 論説},
 pages = {197--205},
 title = {On E-kKP as a knapsack problem related to the conventional 2-approximation algorithm for the 0-1 knapsack problem},
 volume = {66},
 year = {2015}
}