English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 57970/91504 (63%)
造訪人次 : 13691092      線上人數 : 48
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/19725

    題名: Empirical comparison between two k-shortest path methods for the generalized assignment problem
    作者: Chang, Horng-jinh;Lai, Uei-tseng
    貢獻者: 淡江大學經營決策學系
    日期: 1998-05-01
    上傳時間: 2009-11-30 12:19:50 (UTC+8)
    出版者: New Delhi: Taru Publications
    摘要: 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.
    關聯: Journal of information & optimization sciences 19(2), pp.15-171
    DOI: 10.1080/02522667.1998.10699369
    顯示於類別:[管理科學學系暨研究所] 期刊論文





    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回饋