The genetic algorithm (GA) proposed by J. Holland [10] is a randomized heuristic search method, based on analogy with the genetic mechanisms observed in nature and employing a population of tentative solutions. Different modifications of GA are widely used in the areas of operations research pattern recognition, artificial intelligence etc. (see e.g. [13, 16]). Despite of numerous experimental ...

We address the fundamental network design problem of constructing approximate minimum spanners. Our contributions are for the distributed setting, providing both algorithmic and hardness results. Our main hardness result shows that an α-approximation for the minimum directed kspanner problem for k ≥ 5 requires Ω(n/ √ α log n) rounds using deterministic algorithms or Ω( √ n/ √ α log n) rounds us...

the set covering problem (scp) is a well-known combinatorial optimization problem. this paper investigates development of a local branching approach for the scp. this solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. the algorithm parameters are tuned by design of experiments approach. the proposed method is te...

While the additive model is a popular nonparametric regression method, many of its theoretical properties are not well understood, especially when the back tting algorithm is used for computation of the the estimators. This article explores those properties when the additive model is tted by local polynomial regression. Su cient conditions guaranteeing the asymptotic existence of unique estimat...

one of the most valuable and important application of artificial satellites in geodetic sciences is recovery of the earth's gravity field. orbits of satellites either gravimetric or nongravimetric are analyzed to improve the earth's gravity field. gravimetric satellites are launched at low altitudes to observe gravity field in more detail. grace twin satellites are the second spacecra...

This paper addresses the Tardy/Lost penalty minimization with common due dates on a single machine. According to this performance measure, if the tardiness of a job exceeds a predefined value, the job will be lost and penalized by a fixed value. Initially, we present a 2-approximation algorithm and examine its worst case ratio bound. Then, a pseudo-polynomial dynamic programming algorithm is de...