Comments on knapsack problems with a penalty

Hiroshi Iida

ビジネス創造センターディスカッション・ペーパー (Discussion papers of the Center for Business Creation) from Otaru University of Commerce

Abstract: The classical binary knapsack problem has numerous generalisations in relation to not only a capacity constraint but also an objective function. In 2006, two knapsack problems have coincidentally been proposed, both of which have an extension of the objective function paying the penalty. This article gives some comments on the two problems.

Keywords: Combinatorial Optimisation; Knapsack Problem; Penalty (search for similar items in EconPapers)
Pages: 5 pages
Date: 2007-03
References: View references in EconPapers View complete reference list from CitEc
Citations:

Published in Discussion paper series (2007), 110: 1-5

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:busdis:10252/910

Access Statistics for this paper

More papers in ビジネス創造センターディスカッション・ペーパー (Discussion papers of the Center for Business Creation) from Otaru University of Commerce Contact information at EDIRC.
Bibliographic data for series maintained by Miura, Chiho ().