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/741Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Goldengorin, B. | - |
| dc.contributor.author | Ghosh, Diptesh | - |
| dc.date.accessioned | 2010-01-16T09:36:15Z | - |
| dc.date.available | 2010-01-16T09:36:15Z | - |
| dc.date.copyright | 2002-02 | - |
| dc.date.issued | 2010-01-16T09:36:15Z | - |
| dc.identifier.uri | http://hdl.handle.net/11718/741 | - |
| dc.description.abstract | In this paper we consider the well-known binary knapsack problem. We propose a method of embedding heuristicsi in a branch and bound framework to optain solutions with profits within a pre-specified quality parameter within very short times. Our computational experiements on the more deficult problems show that algorithm can genrate solutions with profits within 0.01% of that of an optimal solution in less than 10% of the time required by exact algorithms based on similar priciples. | en |
| dc.language.iso | en | en |
| dc.relation.ispartofseries | W.P.;1689 | - |
| dc.subject | Binary systems | en |
| dc.title | Obtaining near-optimal solutions for the binary knapsack problem | en |
| dc.type | Working Paper | en |
| Appears in Collections: | Working Papers | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| WP 2002_1689.pdf | 716.02 kB | Adobe PDF | View/Open |
Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.