This paper develops a method for solving the single product multi-period production-planning problem, in which the production and the inventory costs of each period arc concave and backlogging is not permitted. It is also assumed that the unit variable cost of the production evolves according to a continuous time Markov process. We prove that this production-planning problem can be Stated as a ...

In a dynamic network, the quickest path problem asks for a path minimizing the time needed to send a given amount of flow from source to sink along this path. In practical settings, for example in evacuation or transportation planning, the reliability of network arcs depends on the specific scenario of interest. In this circumstance, the question of finding a quickest path among all those havin...

Applying a minimum-cost path algorithm to find the path through the bottom of a curvilinear valley yields a biased path through the inside of a corner. DNA molecules, blood vessels, and neurite tracks are examples of string-like (network) structures, whose minimum-cost path is cutting through corners and is less flexible than the underlying centerline. Hence, the path is too short and its shape...

To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to nd low-cost paths that satisfy given Quality-of-Service (QoS) constraints. However, the problem of constrained shortest (least-cost) path routing is known to be NP-hard, and some heuristics have been proposed to nd a near-optimal solution. However, these heuristics e...

We study the minimum cost path problem in an environment where the cost is direction-dependent (anisotropic). This problem arise in sailing, robotics, aircraft navigation, and routing of autonomous vehicles, where the cost is affected by the direction of waves, winds or slope of the terrain. We present an approximation algorithm to find a minimum cost path for a point robot moving in a planar s...

Routing real-time traffic with good Quality of Service (QoS) is a challenging task in Mobile Ad-Hoc Networks (MANETs). Energy Aware Fuzzy based Multi Constrained Single path QoS Routing (E-FMSQR) protocol which is an extension of AODV is proposed to find an optimal path by considering multiple QoS metrics. Considering Multiconstraints like Bandwidth, Delay, Number of Hops and Energy, a single f...

Path cost optimization is essential for maneuvering vehicles in a cost effective way. The term cost can be interpreted as fuel consumption, path visibility, probability of being detected, probability of being attacked or a combination of the above. Exact algorithms such as linear programming and dynamic programming can always provide globally optimum solution to such a problem. However, as the ...

In this paper, we investigate the problem of finding the Delay Constrained Least Cost path (DCLC) in a network, which is NP-complete and has been extensively studied. Many proposed algorithms tackle this problem by transforming it into the shortest path selection problem or the k-shortest paths selection problem, which are P-complete, with an integrated weight function that maps the delay and c...

In this paper, we focus on the problem of secure multicast in dynamic groups. In this problem, a group of users communicate using a shared group key. Due to the dynamic nature of these groups, to preserve secrecy, it is necessary to change the group key whenever the group membership changes. While the group key is being changed, the group communication needs to be interrupted until the rekeying...