OI algorithm used to solve a variety of 0-1 knapsa - CodeBus

Welcome！[Sign In] ！[Sign Up]！

Front-page it | Collect it | [中国-简体中文]

FAQ Fav

Location:

Title: OI

Category:
Algorithm
Tags:
[Windows] [Visual C] [源码]
File Size:
420.98kb
Update:
2008-10-13
Downloads:
1 Times
Uploaded by:
WANGCHUUIYU

Description: algorithm used to solve a variety of 0-1 knapsack problem, including the retrospective method, dynamic programming, greedy algorithm

Downloaders recently: [More information of uploader WANGCHUUIYU]

To Search: knapsack greedy oi

[sourcelibrarymanagement.Rar] - language with a series of library manage
[sourcecode(vc).Rar] - containing five small programs, namely :
[optimalbinarysearchtree.Rar] - algorithm design of dynamic optimal plan
[twohourscoverage.Rar] - procedures with the greedy algorithm to
[knap1] - 0-1 knapsack problem fringe interface us
[GoodPointSetBasedGeneticAlgorithm] - use of the theory of good points of the
[ACM] - West electricity ACM classes used PPT le
[0-1beibao] - 01 knapsack problem subject N items and
[zlg_boot] - Week Ligong MAGICARM2200- ZLG_BOOT
[LCS] - KMP algorithm realize the longest common

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

CodeBus www.codebus.net

“CodeBus” is the largest source code store in internet!

1999-2018 CodeBus All Rights Reserved.