Show simple item record

dc.contributor.authorGoldengorin, B.
dc.contributor.authorGhosh, Diptesh
dc.date.accessioned2010-01-16T09:36:15Z
dc.date.available2010-01-16T09:36:15Z
dc.date.copyright2002-02
dc.date.issued2010-01-16T09:36:15Z
dc.identifier.urihttp://hdl.handle.net/11718/741
dc.description.abstractIn 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.isoenen
dc.relation.ispartofseriesW.P.;1689
dc.subjectBinary systemsen
dc.titleObtaining near-optimal solutions for the binary knapsack problemen
dc.typeWorking Paperen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record