On E-kKP as a knapsack problem related to the conventional 2-approximation algorithm for the 0-1 knapsack problem

Hiroshi Iida

商学討究 (Shogaku Tokyu), 2015, vol. 66, issue 1, 197-205

Abstract: 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.

Date: 2015
References: View complete reference list from CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ota:ecorev:10252/5473

Access Statistics for this article

More articles in 商学討究 (Shogaku Tokyu) from Otaru University of Commerce Contact information at EDIRC.
Bibliographic data for series maintained by Miura, Chiho ().