淡江大學機構典藏:Item 987654321/19725
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 58273/91818 (63%)
造访人次 : 13798354      在线人数 : 43
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: 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
    显示于类别:[管理科學學系暨研究所] 期刊論文

    文件中的档案:

    没有与此文件相关的档案.

    在機構典藏中所有的数据项都受到原著作权保护.

    TAIR相关文章

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