Now showing items 1-1 of 1

    • Obtaining near-optimal solutions for the binary knapsack problem 

      Goldengorin, B.; Ghosh, Diptesh (2010-01-16)
      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 ...