We consider combinatorial optimization problems for which the formation of a neighborhood structure of feasible solutions is impeded by a set of constraints. Neighborhoods are recovered by relaxing the complicating constraints into the objective function within a penalty term. We examine a heuristic called compressed annealing that integrates a variable penalty multiplier approach within the fr...

Given n independent random marked d-vectors Xi with a common density, define the measure νn = ∑ i ξi, where ξi is a measure (not necessarily a point measure) determined by the (suitably rescaled) set of points near Xi. Technically, this means here that ξi stabilizes with a suitable power-law decay of the tail of the radius of stabilization. For bounded test functions f on Rd, we give a law of l...

This investigation deals with multi server queue with balking. The customers arrive in poisson fashion and independent of time, under the assumption that system is initially empty. The number of customers in the system is stochastically increasing and distributed in steady state (stationary state) as required. The expressions for the measure of the speed of convergence from transient state to s...

If $G$ is a connected graph with vertex set $V$, then the eccentric connectivity index of $G$, $xi^c(G)$, is defined as $sum_{vin V(G)}deg(v)ecc(v)$ where $deg(v)$ is the degree of a vertex $v$ and $ecc(v)$ is its eccentricity. In this paper we show some convergence in probability and an asymptotic normality based on this index in random bucket recursive trees.