id	author	title	date	pages	extension	mime	words	sentences	flesch	summary	cache	txt
work_fhuo7yphnzdujox5ixsw6b6lfa	Jordi Pereira	Variable neighborhood search heuristics for a test assembly design problem	2015	34	.pdf	application/pdf	13648	1376	65	items (questions) among those available to define one or several tests (questionnaires) subject to specific constraints and objectives. solutions provided by the SA deteriorates as the number of questionnaires increases, which may identify possible improvements if different solution methods solution in which questionnaires may only use one question from each set. In this case, the subset sum knapsack problem considers the optimal assignment of questions to one of the questionnaires (i.e., implicitly assigning the The optimal solution to the previously defined subset sum knapsack problem provides an optimal assignment of questions to questionnaires. To generate sets of instances with similar weights, the method initially obtains the difficulty π1t and discrimination effect ρ1t from the first question of each Finally, the quality of the proposed procedures is tested in computational experiments on instances with up to 60.000 item pools, up to 12.000 questionnaires,	./cache/work_fhuo7yphnzdujox5ixsw6b6lfa.pdf	./txt/work_fhuo7yphnzdujox5ixsw6b6lfa.txt