background: multiple choice tests (mct), are widely known and applied as useful evaluation tests in the field of education especially in medical science. items on a multiple-choice test consist of a stem, which is followed by a correct answer as well as three to four distracters. items on a well-written multiple-choice test will have stems that are precise and clear, one answer that is clearly ...

This paper presents a combinatorial algorithm for downlink rate allocation in Code Division Multiple Access (CDMA) mobile networks. By discretizing the coverage area into small segments, the transmit power requirements are characterized via a matrix representation that separates user and system characteristics. We obtain a closed-form analytical expression for the so-called Perron-Frobenius eig...

The knapsack problem (KP) is a very famous NP-hard problem in combinatorial optimization. Also its generalization to multiple dimensions named d-dimensional knapsack problem (d-KP) and to multiple knapsacks named multiple knapsack problem (MKP) are well known problems. Since KP, d-KP, and MKP are integer-valued problems defined on inputs of various informations, we study the fixed-parameter tra...

A knapsack problem is to select a set of items that maximizes the total profit selected while keeping weight no less than capacity knapsack. As generalized form with multiple knapsacks, multi-knapsack (MKP) disjointed for each To solve MKP, we propose deep reinforcement learning (DRL) based approach, which takes as input available capacities profits and weights items, normalized unselected dete...

Urban rail transit (URT) is the backbone transport mode in metropolitan areas to accommodate large travel demands. The high energy consumption of URT becomes a hotspot problem due ever-increasing operation mileages and pressing agendas carbon neutralization. model complexity inconsistency objectives minimizing passenger time operational are main challenges for energy-efficient timetabling netwo...

Floor space optimisation (FSO) is a critical revenue management problem commonly encountered by today's retailers. It maximises 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 metaheuristic that exploits multiple spec...

background: the method of evaluation in students’ learning affects their studying mode. the aim of this study was to compare nursing students’ scores in essay and multiple-choice questions in mother and child health examination in shahrekord university of medical sciences. methods: in this study, the  final scores of 121 of nursing students in a multiple-choice questionnaire consisting of 40 qu...

Knapsack constraints are a key modeling structure in constraint programming. These constraints are normally handled with simple bounding arguments. We propose a dynamic programming structure to represent these constraints. With this structure, we are able to achieve hyper-arc consistency, to determine infeasibility before all variables are set, to generate all solutions quickly, and to provide ...