Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 2 of 2 for “"dynamic cycle networks"”.

  1. Minmax sink location problem on dynamic cycle networks

    We address both 1 and k sink location problems on dynamic cycle networks. Our 1-sink algorithms run in O(n) and O(nlogn) time for uniform and general edge capacity cases, respectively. We improve the previously best known O(nlogn) time algorithm for single sink introduced by Xu et al. [Xu et al. …

    lethbridge Repository record for Minmax sink location problem on dynamic cycle networks (opens in a new tab)

  2. Minsum sink location and evacuation problem on dynamic cycle networks

    … 1-sink location and k-sink evacuation problem on dynamic cycle networks. We consider the 1-sink location problem is to find the optimal location of the 1 sink, while the k-sink evacuation problem is to find the optimal evacuation protocol for the given locations of the k sinks. Both results …

    lethbridge Repository record for Minsum sink location and evacuation problem on dynamic cycle networks (opens in a new tab)