| 008 |
|
180624s2018 ch ad e bm 000 0 chi d |
| 020 |
|
|c贈(平裝)
|
| 040 |
|
|aTMUE |bchi |cTMUE|dTMUE|eccr
|
| 041 |
1
|
|achi|bchi|beng
|
| 084 |
|
|a008.8312 |b1041|2ncsclt
|
| 100 |
1
|
|a王在玨
|
| 245 |
10
|
|a使用線性鬆弛及基因演算法解p-中心位點問題 = |bUsing Linear Programming Relaxation and Genetic Algorithm to Solve The p-centdian Problem / |c王在玨撰
|
| 246 |
31
|
|aUsing Linear Programming Relaxation and Genetic Algorithm to Solve The p-centdian Problem
|
| 260 |
|
|a臺北市 :|b臺北市立大學,|c民107[2018]
|
| 300 |
|
|a38葉 : |b圖表 ; |c30公分
|
| 500 |
|
|a畢業學年度:106
|
| 500 |
|
|a指導教授 : 陳彥宏
|
| 500 |
|
|a英文題名 : Using Linear Programming Relaxation and Genetic Algorithm to Solve The p-centdian Problem
|
| 502 |
|
|a碩士論文--臺北市立大學資訊科學系碩士班,民107
|
| 504 |
|
|a含參考書目
|
| 653 |
0
|
|a組合最佳化問題
|
| 653 |
0
|
|a線性鬆弛法
|
| 653 |
0
|
|a基因演算法
|
| 653 |
0
|
|a中心位點問題
|
| 653 |
0
|
|a瓶頸問題
|
| 653 |
0
|
|aNP完全
|
| 653 |
0
|
|acombinatorial optimization
|
| 653 |
0
|
|alinear programming relaxation
|
| 653 |
0
|
|agenetic algorithm
|
| 653 |
0
|
|ap-centdian
|
| 653 |
0
|
|abottleneck problem
|
| 653 |
0
|
|aNP-complete
|
| 856 |
40
|
|uhttps://theses.utaipei.edu.tw/gs32/stdcdr_ut/record/#G0G10416012|z臺北市立大學博碩士全文影像系統
|