Efficient Algorithms for the Knapsack Sharing Problem
AbstractIn 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.
Download InfoTo our knowledge, this item is not available for download. To find whether it is available, there are three options:
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
Bibliographic InfoPaper provided by UniversitÃ© PanthÃ©on-Sorbonne (Paris 1) in its series Papiers d'Economie MathÃ©matique et Applications with number 2000.122.
Length: 19 pages
Date of creation: 2000
Date of revision:
Contact details of provider:
Postal: France; Universite de Paris I - Pantheon- Sorbonne, 12 Place de Pantheon-75005 Paris, France
Phone: + 33 44 07 81 00
Fax: + 33 1 44 07 83 01
Web page: http://cermsem.univ-paris1.fr/
More information through EDIRC
EFFICIENCY ; PROFIT ; BEHAVIOUR;
Find related papers by JEL classification:
- C60 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - General
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Thomas Krichel).
If references are entirely missing, you can add them using this form.