| Empirical comparison between two k-shortest path methods for the generalized assignment problem | |
|---|---|
| 學年 | 86 |
| 學期 | 2 |
| 出版（發表）日期 | 1998-05-01 |
| 作品名稱 | Empirical comparison between two k-shortest path methods for the generalized assignment problem |
| 作品名稱（其他語言） | |
| 著者 | Chang, Horng-jinh; Lai, Uei-tseng |
| 單位 | 淡江大學經營決策學系 |
| 出版者 | New Delhi: Taru Publications |
| 著錄名稱、卷期、頁數 | Journal of information & optimization sciences 19(2), pp.15-171 |
| 摘要 | In this paper two k-shortest path methods are reformulated for determining the optimal solution of a generalized assignment problem. On the contrary, one is quite capable of dealing with lower capacitated problems while the other with higher ones. Computation study on the random problems gives the further comparisons and the effects of model capacity on the feasibility. |
| 關鍵字 | |
| 語言 | en |
| ISSN | 0252-2667 2169-0103 |
| 期刊性質 | 國外 |
| 收錄於 | |
| 產學合作 | |
| 通訊作者 | |
| 審稿制度 | 否 |
| 國別 | IND |
| 公開徵稿 | |
| 出版型式 | ,電子版,紙本 |
| 相關連結 |
機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/19725 ) |
| SDGS | 優質教育,產業創新與基礎設施 |
GoogleAnalytics