Computing the <i>N</i> Best Loopless Paths in a Network

Clarke, Samuel; Krikorian, A. D.; Rausen, J.

doi:10.1137/0111081

Cited by 41 publications

(29 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Such an algorithm can be derived by minor modifications to the "N best loopless paths" algorithm of Clarke, Krikorian, and Rausen [2] (their algorithm will be referred to as the CKR algorithm from this point on). In seeking the N best loopless paths the CKR algorithm concentrates on paths which have at most one loop.…”

Section: An Rth Shortest Route Algorithmmentioning

confidence: 99%

Optimal interdiction of a supply network

McMasters¹,

Mustin²

1970

Naval Research Logistics

151

View full text Add to dashboard Cite

Under certain conditions, the re‐supply capability of a combatant force may be limited by the characteristics of the transportation network over which supplies must flow. Interdiction by an opposing force may be used to reduce the capacity of that network. The effects of such efforts vary for differing missions and targets. With only a limited total budget available, the interdictor must decide which targets to hit, and with how much effort. An algorithm is presented for determining the optimum interdiction plan for minimizing network flow capacity when the minimum capacity on an arc is positive and the cost of interdiction is a linear function of arc capacity reduction.

show abstract

Section: An Rth Shortest Route Algorithmmentioning

confidence: 99%

Optimal interdiction of a supply network

McMasters¹,

Mustin²

1970

Naval Research Logistics

151

View full text Add to dashboard Cite

show abstract

“…(13). It was observed that, after approximately 20 iterations, the displacement constraints start to compete and oscillatory behavior ensues.…”

Section: Density-based Optimization Resultsmentioning

confidence: 98%

“…The best-known solution to the KSSP problem is Yen's algorithm, for which a number of implementations have been proposed [13][14][15]. By way of example, it is now shown how an initial iteration of Yen's KSSP algorithm for the lattice shown in Fig.…”

Section: B K Shortest Simple Pathsmentioning

confidence: 99%

Topological Optimization of Compliant Adaptive Wing Structure

Santer

Pellegrino

2009

AIAA Journal

View full text Add to dashboard Cite

Load-path-based topology optimization is used to synthesize a compliant adaptive aircraft wing leading edge, which deforms in a prescribed way when subject to a single point internal actuation. The load-path-based optimization method requires the specification of a parent lattice. Increasing the complexity of this lattice means the number of parameters required for a complete representation of the structure in the topology optimization becomes prohibitive, although it is desirable to enable a full exploration of the design space. A new method based on graph theory and network analysis is proposed, which enables a substantial reduction in the required number of parameters to represent the parent lattice. The results from this load-path-based approach are compared with those obtained from the better-known density-based topology optimization method.

show abstract

“…Bock, Kantner, and Haynes [1], Pollack [2], Clarke, Krikorian, and Rausan [3], Sakarovitch [4], Azevedo at. al.…”

Section: Introductionmentioning

confidence: 99%

Comprehensive Study on Computational Methods for K-Shortest Paths Problem

Mohanta¹

2012

IJCA

View full text Add to dashboard Cite

The application domains like network connection routing, highway and power line engineering, robot motion planning and other optimization problems require the computation of shortest path. Computations of K-shortest paths provide more (K-1) numbers of backup shortest paths for consideration, which enable the applicability of additional constraints on the particular domains. For instance, a biologist can determine the best of an alignment from the available instances of biological sequence alignments generated from more than one shortest paths computation. The purpose of this paper is to provide a comprehensive review of existing algorithms available for Kshortest paths computation. It will be useful for researcher to implement the effective K-shortest paths computation based on their matching computational requirements over the domain of their interest.

show abstract

Computing the N Best Loopless Paths in a Network

Cited by 41 publications

References 2 publications

Optimal interdiction of a supply network

Optimal interdiction of a supply network

Topological Optimization of Compliant Adaptive Wing Structure

Comprehensive Study on Computational Methods for K-Shortest Paths Problem

Contact Info

Product

Resources

About