The resource constrained shortest path problem is an NP-hard problem for which many ingenious algorithms have been developed. These algorithms are usually implemented in FORTRAN or another imperative programming language. We have implemented some of the simpler algorithms in a lazy functional language. Beneets accrue in the software engineering of the implementations. Our implementations have b...

This paper shows that a method that has long been used to solve Resource Constrained Optimization Problems and found extremely effective in practice, is effective in the theoretical sense as well, it is proved to be strongly polynomial. In the special case of Resource Constrained Shortest Path Problem a better running time estimation is also presented.

A label setting algorithm for solving the Elementary Resource Constrained Shortest Path Problem, using node resources to forbid repetition of nodes on the path, is implemented. A state-space augmenting approach for accelerating run times is considered. Several augmentation strategies are suggested and compared numerically. © 2005 Elsevier B.V. All rights reserved.

We present a survey of results in the field of graph algorithms. We begin with an All Pairs Shortest Path algorithm with some constraints that runs in O(n) by Peres. We continue with a Replacement Paths algorithm by Williams and conclude with a smoothed analysis of a Single Source Shortest Paths algorithm by Banderier. Each of these problems has connections to randomization in graph algorithms.

In this paper we consider algorithms for the logical topology design and traffic grooming problem in WDM networks with router interface constraints as well as optical constraints. The optical constraints include restricted transmission range due to optical impairments as well as limits on the number of available wavelengths. We formulate this problem as an integer linear program which is NP-com...

Interprocedural analysis is at the heart of numerous applications in programming languages, such as alias analysis, constant propagation, etc. Recursive state machines (RSMs) are standard models for interprocedural analysis. We consider a general framework with RSMs where the transitions are labeled from a semiring, and path properties are algebraic with semiring operations. RSMs with algebraic...

A temporal constraint management system (TCMS) is a temporal network together with algorithms for managing the constraints in that network over time. This paper presents a practical TCMS, called MYSYSTEM, that efficiently handles the propagation of the kinds of temporal constraints commonly found in realtime applications, while providing constant-time access to “all-pairs, shortest-path” inform...