English  |  正體中文  |  简体中文  |  Items with full text/Total items : 62570/95233 (66%)
Visitors : 2553743      Online Users : 297
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/19725

    Title: Empirical comparison between two k-shortest path methods for the generalized assignment problem
    Authors: Chang, Horng-jinh;Lai, Uei-tseng
    Contributors: 淡江大學經營決策學系
    Date: 1998-05-01
    Issue Date: 2009-11-30 12:19:50 (UTC+8)
    Publisher: New Delhi: Taru Publications
    Abstract: 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.
    Relation: Journal of information & optimization sciences 19(2), pp.15-171
    DOI: 10.1080/02522667.1998.10699369
    Appears in Collections:[Department of Management Sciences] Journal Article

    Files in This Item:

    File SizeFormat

    All items in 機構典藏 are protected by copyright, with all rights reserved.

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