Obtaining near-optimal solutions for the binary knapsack problem
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 |
Files in this item
This item appears in the following Collection(s)
-
Working Papers [2627]
Working Papers