English  |  正體中文  |  简体中文  |  Items with full text/Total items : 67621/67621 (100%)
Visitors : 23159894      Online Users : 459
RC Version 7.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


    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/29697


    Title: THE HYBRID SPANNING TREE PROBLEM
    Authors: CHEN,YL
    Contributors: 資訊管理研究所
    Date: 1994
    Issue Date: 2010-06-29 20:38:29 (UTC+8)
    Publisher: 中央大學
    Abstract: The minimal spanning tree problem is a well-known problem in operations research. In this paper, a new variant of the minimal spanning tree problem, termed the hybrid spanning tree problem, is proposed. This problem assumes that each edge in the network has two attributes, where the first is the cost and the second is the degree of difficulty. The bottleneck of a tree is the maximum degree of difficulty of all edges in the tree. The hybrid spanning tree problem is to find a spanning tree in the network such that the weighted objective function of alpha x (the total cost of the tree) + beta x (the bottleneck of the tree) is minimized. In this paper, two efficient algorithms are proposed. When the values of alpha and beta are given nonnegative constants, the first algorithm can find the minimal weight spanning tree in time of O(mn), where m and n are the numbers of edges and nodes in the network, respectively. When the values of alpha and beta are nonnegative variables, the second algorithm can find all possible minimal weight spanning trees also in time O(mn).
    Relation: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
    Appears in Collections:[資訊管理研究所] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML473View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback  - 隱私權政策聲明