This contribution investigates situations in pedestrian dynamics, where trying to walk the shortest path leads to largely different results than trying to walk the quickest path. A heuristic one-shot method to model the influence of the will to walk the quickest path is

In this interesting paper Professor Nikiforov reviewed the current state of quickest change detection/isolation problem. In our discussion of his paper we focus on the concerns and the opportunities of the subfield of quickest change detection, or more generally, sequential methodologies, in the modern

Let N = (V, R, e, I) be an input network with node set V, arc set A, positive arc weight function c and nonnegative arc weight function 1. Let u be the amount of data to be transmitted. The quickest path problem is to find a routing path in N to transmit the given amount of data in minimum time. In a recent paper, Chen and Chin proposed this problem and developed algorithms for the single pair ...

The paper deals with the quickest detection of intensity change for Poisson process. We show that the generalized Bayesian formulation of the quickest detection problem can be reduced to the conditional-extremal optimal stopping problem for a piecewise-deterministic Markov process. For this problem the optimal procedure is described and its characteristics are found.

Hung, Y.-C. and G.-H. Chen, Distributed algorithms for the quickest path problem, Parallel Computing 18 (1992) 823-834. Let N=(V, A, C, L) be a network with node set V, arc set A, positive arc capacity function C, and nonnegative arc lead time function L. The quickest path problem is to find paths in N to transmit a given amount of data such that the transmission time is minimized. In this pape...

We consider the quickest flow problem in dynamic networks with a single source s and a single sink t: given an amount of flow F , find the minimum time needed to send it from s to t, and the corresponding optimal flow over time. We introduce new mathematical formulations and derive optimality conditions for the quickest flow problem. Based on the optimality conditions, we develop a new costscal...

We extend the discrete-time dynamic ow algorithms presented in the literature to solve the analogous continuous-time dynamic ow problems. These problems include nding maximum dynamic ows, quickest ows, universally maximum dynamic ows, lexicographically maximum dynamic ows, dynamic transshipments, and quickest transshipments in networks with capacities and transit times on the edges.

We consider the quickest flow problem in dynamic networks with a single source s and a single sink t: given a flow F , find the minimum time needed to send F from s to t, and the corresponding optimal flow over time. We introduce new mathematical formulations and derive optimality conditions for the quickest flow problem. Based on the optimality conditions, we develop a new cost-scaling algorit...