English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 94559/125088 (76%)
Visitors : 29763114      Online Users : 389
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU 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
    政大機構典藏 > 商學院 > 企業管理學系 > 期刊論文 >  Item 140.119/100734
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/100734

    Title: The First K Minimum Cost Paths in a Time-Schedule Network
    Authors: 唐揆
    Chen, Y. L.;Rinks, D.;Tang, Kwei
    Contributors: 企管系
    Keywords: shortest path;road transport;networks and graphs
    Date: 2001-01
    Issue Date: 2016-08-25 14:10:55 (UTC+8)
    Abstract: The time-constrained shortest path problem is an important generalisation of the classical shortest path problem and in recent years has attracted much research interest. We consider a time-schedule network, where every node in the network has a list of pre-specified departure times and departure from a node may take place only at one of these departure times. The objective of this paper is to find the first K minimum cost simple paths subject to a total time constraint. An efficient polynomial time algorithm is developed. It is also demonstrated that the algorithm can be modified for finding the first K paths for all possible values of total time.
    Relation: Journal of Operational Research Society, 52(1), 102-108
    Data Type: article
    DOI 連結: http://dx.doi.org/10.1057/palgrave.jors.2601028
    DOI: 10.1057/palgrave.jors.2601028
    Appears in Collections:[企業管理學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    102-108.pdf183KbAdobe PDF242View/Open

    All items in 政大典藏 are protected by copyright, with all rights reserved.

    社群 sharing

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