maxProfitBBKnapsack Vc++6 prepared with the proced

Title: maxProfitBBKnapsack

Category:
Data structs
Tags:
[C/C++] [Windows] [Visual C] [源码]
File Size:
1.12mb
Update:
2012-11-26
Downloads:
0 Times
Uploaded by:
lcf_spring

Description: Vc++6 prepared with the procedure for the maximum benefit from branch and bound method to solve knapsack problem.

Downloaders recently: [More information of uploader lcf_spring]

To Search:

[branchboundarymethodTSP] - branch and bound method can solve small-
[jingdiansuanfa] - data structure and classic algorithm

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

maxProfitBBKnapsack
...................\data.txt
...................\Debug
...................\.....\maxProfitBBKnapsack.obj
...................\.....\vc60.idb
...................\.....\vc60.pdb
...................\.....\背包问题（最大收益分枝定界法）.exe
...................\.....\背包问题（最大收益分枝定界法）.ilk
...................\.....\背包问题（最大收益分枝定界法）.pch
...................\.....\背包问题（最大收益分枝定界法）.pdb
...................\function.h
...................\maxProfitBBKnapsack.cpp
...................\variable.h
...................\背包问题（最大收益分枝定界法）.dsp
...................\背包问题（最大收益分枝定界法）.dsw
...................\背包问题（最大收益分枝定界法）.ncb
...................\背包问题（最大收益分枝定界法）.opt
...................\背包问题（最大收益分枝定界法）.plg