Journal ArticleDOI
Algorithms for the Weight Constrained Shortest Path Problem
Irina Dumitrescu,Natashia Boland +1 more
Reads0
Chats0
TLDR
In this paper, the authors considered the case of the weight constrained shortest path problem (WCSPP) defined on a graph without cycles and presented a new exact algorithm, based on scaling and rounding of weights.About:
This article is published in International Transactions in Operational Research.The article was published on 2001-01-01. It has received 78 citations till now. The article focuses on the topics: Shortest path problem & Longest path problem.read more
Citations
More filters
Journal ArticleDOI
Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem
Irina Dumitrescu,Natashia Boland +1 more
TL;DR: It is shown that integrating information obtained in preprocessing within the label‐setting method can lead to very substantial improvements in both memory required and run time, in some cases, by orders of magnitude.
Book ChapterDOI
Optimal Risk Path Algorithms
TL;DR: Analytical and discrete optimization approaches for routing an aircraft in a threat environment have been developed and an aircraft’s optimal risk trajectory with a constraint on the path length can be efficiently calculated.
Journal ArticleDOI
An intermodal transport network planning algorithm using dynamic programming--A case study: from Busan to Rotterdam in intermodal freight routing
TL;DR: A dynamic programming algorithm to draw optimal intermodal freight routing with regard to international logistics of container cargo for export and import and a Weighted Constrained Shortest Path Problem (WCSPP) model are presented.
Journal ArticleDOI
Aircraft routing under the risk of detection
TL;DR: Analytical and discrete optimization approaches for routing an aircraft with variable radar cross‐section (RCS) subject to a constraint on the trajectory length have been developed and the impact of ellipsoid shape on the geometry of an optimal trajectory as well as the impact on the performance of a network optimization algorithm have been analyzed and illustrated by several numerical examples.
Posted Content
Joint Energy Efficient and QoS-aware Path Allocation and VNF Placement for Service Function Chaining
TL;DR: In this article, the authors propose a resource reallocation architecture which enables energy-aware service function chaining (SFC) for SDN-based networks, where VNF placement, allocation of VNFs to flows, and flow routing are modeled as optimization problems.
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Journal ArticleDOI
Finding the K Shortest Loopless Paths in a Network
TL;DR: The significance of the new algorithm is that its computational upper bound increases only linearly with the value of K, so it is extremely efficient as compared with the algorithms proposed by Bock, Kantner, and Haynes and others.