ScholarLens Back to search
2002•Unpublished venueRequires access

An Algorithm for the Multiweights Shortest-Path Problem with Constraints

Dai Shu

Open publisher page 0 citations

Abstract

Aiming at multiweights network, this paper presents an algorithm for the shortest path problem with constraints. In the algorithm the shortest path with constraints from the source to the end are gained according to dictionary order.

About this research paper

What this paper is about

Aiming at multiweights network, this paper presents an algorithm for the shortest path problem with constraints. In the algorithm the shortest path with constraints from the source to the end are gained according to dictionary order.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Aiming at multiweights network, this paper presents an algorithm for the shortest path problem with constraints. In the algorithm the shortest path with constraints from the source to the end are gained according to dictionary order.

Key concepts: Shortest path problem, K shortest path routing, Yen's algorithm, Path (computing), Shortest Path Faster Algorithm, Constrained Shortest Path First, Algorithm, Longest path problem

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
An Algorithm for the Multiweights Shortest-Path Problem with Constraints — Research Paper | ScholarLens