Respectively dynamic programming algorithm, hand address the resource allocation problem. The other is programmed to solve the following problem: a convex 8-gon P, vertex clockwise of (v1, v2, ..., v8), any two vertices of the segment between the weight given by the matrix D. If vi and vj is the P is not adjacent to two vertices, then the line segment vivj known as P, a string. Seeking P, a set of strings T, makes the T all the strings just to P divided into non-overlapping triangles, and the weight of each triangle and for the minimum (the weight of a triangle is its weight of each side and) .

两个动态规划的问题.pdf
这两个问题的解决办法-手工算法和程序说明.doc
project-algrithm\Debug\trangle.obj
................\.....\trangle.sbr
................\.....\vc60.idb
................\.....\vc60.pdb
................\.....\xiaoxia_algrithm.bsc
................\.....\xiaoxia_algrithm.exe
................\.....\xiaoxia_algrithm.ilk
................\.....\xiaoxia_algrithm.pch
................\.....\xiaoxia_algrithm.pdb
................\trangle.c
................\xiaoxia_algrithm.dsp
................\xiaoxia_algrithm.dsw
................\xiaoxia_algrithm.ncb
................\xiaoxia_algrithm.opt
................\xiaoxia_algrithm.plg
................\Debug
project-algrithm

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．