In this paper we exploit concepts from Information Theory to improve the classical Chvatal greedy algorithm for set covering problem. particular, develop a new procedure, called Surprisal-Based Greedy Heuristic (SBH), incorporating computation of “surprisal” measure when selecting solution columns. Computational experiments, performed on instances OR-Library, showed that SBH yields 2.5% improve...

  For efficiency evaluation of some of the Decision Making Units that have uncertain information, Rough Data Envelopment Analysis technique is used, which is derived from rough set theorem and Data Envelopment Analysis (DEA). In some situations rough data alter nonradially. To this end, this paper proposes additive rough–DEA model and illustrates the proposed model by a numerical example.

location selection is one of the most important activities in establishment of bank branches. choosing a suitable location have a direct impact on the performance of banks and also facilitating the achievement of other objectives. there are a lot of influential factors on the location selection which are complicated and therefore the traditional methods cannot be used. so we need to have a suit...