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 6 of 6 for “"Constrained shortest paths"”.

  1. Resource constrained shortest paths and extensions

    … programming techniques to solve the resource constrained shortest path problem (RCSPP) which seeks a minimum cost path between two nodes in a directed graph subject to a finite set of resource constraints. Although NP-hard, the RCSPP is extremely useful in practice and often appears as a …

    gatech Repository record for Resource constrained shortest paths and extensions (opens in a new tab)

  2. Constrained Shortest Paths in Terrains and Graphs

    Finding a shortest path is one of the most well-studied optimization problems. In this thesis we focus on shortest paths in geometric and graph theoretic settings subject to different feasibility constraints that arise in practical applications of such paths. One of the most fundamental problems in …

    waterloo Repository record for Constrained Shortest Paths in Terrains and Graphs (opens in a new tab)

  3. Time constrained shortest paths in stochastic and dynamic transportation networks

    This thesis develops methodologies for solving constrained shortest path problems in dynamic and random conditions. Due to the randomness of the network, the decisions need to account for uncertainty of the future real-time network state. Currently the randomness of the arc attributes is not taken …

    texas Repository record for Time constrained shortest paths in stochastic and dynamic transportation networks (opens in a new tab) Restricted access

  4. Constrained shortest paths for QoS routing and path protection in communication networks.

    … the selection of a set of k > 1 link-disjoint paths with minimum total cost and with total delay bounded by a given upper bound. This problem arises in the context of provisioning paths in a network that could be used to provide resilience to link failures. Again we studied the LP relaxation of …

    oklahoma-thes Repository record for Constrained shortest paths for QoS routing and path protection in communication networks. (opens in a new tab)

  5. REAL TIME OPTIMIZATION IN NETWORKS: PRACTICAL ALGORITHMS WITH PROVABLE GUARANTEES

    … The first problem we study is computing Constrained Shortest Paths at scale. Even though the underlying optimization problem is NP-Hard, we can give parametric guarantees for the space requirement and running time of our algorithm. We use precomputation techniques, generalize the notion …

    cornell Repository record for REAL TIME OPTIMIZATION IN NETWORKS: PRACTICAL ALGORITHMS WITH PROVABLE GUARANTEES (opens in a new tab)

  6. Time Dynamic Label-Constrained Shortest Path Problems with Application to TRANSIMS: A Transportation Planning System

    … Planner Module is to find time-dependent label-constrained shortest paths for transportation activities performed by travelers in the system. There are several variations of shortest path problems and algorithms that vary by application, contexts, complexity, required data, and computer …

    vt Repository record for Time Dynamic Label-Constrained Shortest Path Problems with Application to TRANSIMS: A Transportation Planning System (opens in a new tab)