Dynamic programming (program code report)

Affiliates: 0,2 $ — how to earn
Pay with:
i agree with "Terms for Customers"
Sold: 4
Refunds: 0

Uploaded: 24.04.2012
Content: algorithms.rar (1786,12 kB)
Loyalty discount! If the total amount of your purchases from the seller IT-shka more than:
30 $the discount is20%
show all discounts
3 $the discount is2%
If you want to know your discount rate, please provide your email:

Seller

IT-shka information about the seller and his items
offlineAsk a question

Seller will give you a gift certificate in the amount of 11,27 RUB for a positive review of the product purchased..

Description

Implementation of many examples of dynamic programming (Dijkstra´s algorithm, the Bellman-Ford, Floyd-Uorshella). The archive contains -Finish program -source code -Reports presentation on 37str with complete description of the theory Contents of the report: 1) The concept of dynamic programming Concept and historical background The main stages of solving the problem 2) Classification Bellman equation of -classical Problem Is the greatest common subsequence Is the greatest increasing subsequence -Problem of drafting a distance Is the order of matrix multiplication Traveling salesman-problem Is the greatest independent set of vertices in the tree 3) The problem of the shortest paths -Production Bellman-Ford-algorithm -algorithm Floyd Uorshella Algorithms Dijkstra 4) Features implementations of algorithms 5) Implementation of the results of computational experiments 6) References

Feedback

0
No feedback yet.
Period
1 month 3 months 12 months
0 0 0
0 0 0
Seller will give you a gift certificate in the amount of 11,27 RUB for a positive review of the product purchased..
In order to counter copyright infringement and property rights, we ask you to immediately inform us at support@plati.market the fact of such violations and to provide us with reliable information confirming your copyrights or rights of ownership. Email must contain your contact information (name, phone number, etc.)