background: evaluation of multiple-choice questions is a strategic activity and the most effective tool in educational system and improvement. in this study, the quality of some indexes of multiple-choice exams in babol para medical faculty was investigated on the basis of structure and knowledge level distribution in the first semesters of 2007 and 2012. methods: the milman checklist was used ...

We study the problem of maximizing a monotone submodular function subject to Multiple Knapsack constraint. The input is set I items, each has non-negative weight, and bins arbitrary capacities. Also, we are given submodular, f over subsets items. objective find packing subset items A⊆I in such that f(A) maximized. Our main result an almost optimal polynomial time (1−e−1−ε)-approximation algorit...

Floor space optimization is a critical revenue management problem commonly encountered by retailers. It maximizes store optimally allocating floor to product categories which are assigned their most appropriate planograms. We formulate the as connected multi-choice knapsack with an additional global constraint and propose tabu search based meta-heuristic that exploits multiple special neighborh...

We consider the distributed version of the Multiple Knapsack Problem (MKP), wherem items are to be distributed amongst n processors, each with a knapsack. We propose different distributed approximation algorithms with a tradeoff between time and message complexities. The algorithms are based on the greedy approach of assigning the best item to the knapsack with the largest capacity. These algor...

In this paper, we propose the assignment problem of resources humans’ methodology by using the multiple knapsack approach to formulate the studied problem, and solve it by using the genetic algorithm for obtaining the optimal assignment of the new qualified employees that ensures the maximization the productivity by introducing constraints corresponding to the cost of each posts, and capacity o...

Connectedness of efficient solutions is a powerful property in multiple objective combinatorial optimization since it allows the construction of the complete efficient set using neighborhood search techniques. In this paper we show that, however, most of the classical multiple objective combinatorial optimization problems do not possess the connectedness property in general, including, among ot...