Binary knapsack problems with random budgets

IIMA Institutional Repository

Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/9879

Full metadata record

DC Field	Value	Language
dc.contributor.author	Das, Shubhabrata
dc.contributor.author	Ghosh, Diptesh
dc.date.accessioned	2010-10-21T11:31:56Z
dc.date.available	2010-10-21T11:31:56Z
dc.date.copyright	2003
dc.date.issued	2003-10-21T11:31:56Z
dc.identifier.uri	http://hdl.handle.net/11718/9879
dc.description	Journal of the Operational Research Society, Vol. 54, No. 9, (2003), pp. 970-983	en
dc.description.abstract	The binary knapsack problem is a combinatorial optimization problem in which a subset of a given set of elements needs to be chosen in order to maximize profit, given a budget constraint. In this paper, we study a stochastic version of the problem in which the budget is random. We propose two different formulations of this problem, based on different ways of handling infeasibility, and propose an exact algorithm and a local search-based heuristic to solve the problems represented by these formulations. We also present the results from some computational experiments.
dc.language.iso	en	en
dc.subject	Static Stochastic Knapsack Problem	en
dc.subject	Random Budget	en
dc.subject	Branch and Bound	en
dc.title	Binary knapsack problems with random budgets	en
dc.type	Article	en
Appears in Collections:	Journal Articles

Files in This Item:

File	Description	Size	Format
Binaryknapsack.pdf Restricted Access		225.06 kB	Adobe PDF	View/Open Request a copy