Location:
Search - qiongjufa
Search list
Description: 用delphi语言实现运筹学穷举法求0-1规划程序-used language tacticians Method 0-1 exhaustive planning process
Platform: |
Size: 226904 |
Author: wuxiaoyan |
Hits:
Description: 用delphi语言实现运筹学穷举法求0-1规划程序-used language tacticians Method 0-1 exhaustive planning process
Platform: |
Size: 226304 |
Author: wuxiaoyan |
Hits:
Description: 数学建模中常用的穷举法程序，具有一般性，非常实用-Mathematical modeling method commonly used in the exhaustive process, with the general, very useful
Platform: |
Size: 1024 |
Author: cb |
Hits:
Description: 穷举法实现度一组数据的全排列
好东西
快-Exhaustive method to achieve the full degree of data arranged in a group of good stuff fast
Platform: |
Size: 12288 |
Author: hedi |
Hits:
Description: 穷举法解决背包问题，对解决算法问题有帮助-The brute-force method to solve the knapsack problem to solve algorithmic problems
Platform: |
Size: 688128 |
Author: 孔明德 |
Hits:
Description: 一． 用穷举法求解下列问题。
1．班上要在A, B, C, D, E, F 6名同学中选派若干人去参加比赛，综合比较各人的情况，得出选择的条件如下：
a) E和F两人中至少去一个；
b) C和D两人中去一个；
c) D和E要么都去，要么都不去；
d) A,B,F三人中要去两个；
e) 若C不去，则B也不去；
f) C和F不能一起去。
请仔细分析上述条件，找出参加比赛的合适人选。
-A. Using brute-force method to solve the following problems. 1. Class in A, B, C, D, E, F 6 classmates in selected certain people to participate in the competition, comprehensive comparison of each situation, draw the selected conditions are as follows: a) E and F are at least two to go a b) C and D, two to go one c) D and E are either all go or not to go d) A, B, F trio go to two e) If the C do not, then B did not go f) C and F can not go together. Carefully analyze the above conditions, identify suitable candidates participate in the competition.
Platform: |
Size: 1024 |
Author: 长城 |
Hits: