Background: The Clustered Orienteering Problem is an optimization problem faced in last-mile logistics. The aim is, given an available time window, to visit vertices and to collect as much profit as possible in the given time. The vertices to visit have to be selected among a set of service...

We consider a version of directed bond percolation on a square lattice whose vertical edges are directed upward with probabilities pv and horizontal edges are directed rightward with probabilities ph and 1 in alternate rows. Let τ(M,N) be the probability that there is a connected directed path...

Using perturbation methods, approximate formulas are obtained for zero-coupon bonds under the generalized Black-Karasinski model. The formulas perform well regarding accuracy and calibration to available data. For a special case, which corresponds to the Hull-White model, the approximation...