bag Branch and bound method to solve 0/1 knapsack

Title: bag

Description: Branch and bound method to solve 0/1 knapsack problem, using c++ Priority queue method

Downloaders recently: [More information of uploader linpeiwen]

To Search:

File list (Check if you may need any files):

bb
..\bags.txt
..\bb.dsp
..\bb.dsw
..\bb.ncb
..\bb.opt
..\bb.plg
..\bbnode.h
..\Debug
..\main.cpp

Main Category