Efficient Algorithms for the Knapsack Sharing Problem

M. Hifi, S. Sadfi and Abdelkader Sbihi ()

Papiers d'Economie Mathématique et Applications from Université Panthéon-Sorbonne (Paris 1)

Abstract: In this paper, we propose two efficient algorithms in order to approximately solve the Knapsack Sharing Problem (KSP). In KSP, we have a knapsack of capicity c and a set of n objects, where each object j, j=1,...,n, is associated with a profit pj and a weight wj. The set of objects is divided into m different classes of objects and, the aim is to determine a subset of objects to be included in the knapsack which realizes a max-min value over all classes.

Keywords: EFFICIENCY; PROFIT; BEHAVIOUR (search for similar items in EconPapers)
JEL-codes: C60 (search for similar items in EconPapers)
Date: 2000

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: http://EconPapers.repec.org/RePEc:fth:pariem:2000.122

Access Statistics for this paper

More papers in Papiers d'Economie Mathématique et Applications from Université Panthéon-Sorbonne (Paris 1)
Address: France; Universite de Paris I - Pantheon- Sorbonne, 12 Place de Pantheon-75005 Paris, France
Contact information at EDIRC.
Series data maintained by Thomas Krichel ().