IIMA Institutional Repository
This Institutional Repository has been created to collect, preserve and distribute the scholarly output of Indian Institute of Management, Ahmedabad. This will work as an important tool to facilitate scholarly communication and preserve the institution knowledge. The Vikram Sarabhai Library is proud to be hosting the repository for the dissemination and preservation of this valuable knowledge resource of the IIMA community.
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11718/9879| Title: | Binary knapsack problems with random budgets |
| Authors: | Das, Shubhabrata Ghosh, Diptesh |
| Keywords: | Static Stochastic Knapsack Problem;Random Budget;Branch and Bound |
| Issue Date: | 21-Oct-2003 |
| 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. |
| Description: | Journal of the Operational Research Society, Vol. 54, No. 9, (2003), pp. 970-983 |
| URI: | http://hdl.handle.net/11718/9879 |
| 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 |
Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.