{"id":"W2102019950","doi":"10.1109/tsmca.2005.851140","title":"A New Heuristic for Solving the Multichoice Multidimensional Knapsack Problem","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics - Part A Systems and Humans","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":116,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Knapsack problem; Continuous knapsack problem; Heuristic; Mathematical optimization; Mathematics; Change-making problem; Relaxation (psychology); Series (stratigraphy); Function (biology); Cutting stock problem; Linear programming; Value (mathematics); Computer science; Applied mathematics; Algorithm; Optimization problem; Statistics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007160304,0.0009808331,0.001258508,0.001374011,0.0007601369,0.001084295,0.001548857,0.001158173,0.002823632],"category_scores_gemma":[0.001642203,0.0005101077,0.0009484599,0.001381724,0.0005728187,0.001527515,0.00104902,0.001352608,0.0006483244],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000627563,"about_ca_system_score_gemma":0.001291418,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002063063,"about_ca_topic_score_gemma":0.003077913,"domain_scores_codex":[0.9991048,0.0002091081,0.0000480562,0.0001059955,0.0003993224,0.0001326773],"domain_scores_gemma":[0.9993413,0.000248313,0.00009869715,0.0001078376,0.0001504632,0.00005342072],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001485887,0.0002665435,0.0005684992,0.0004763611,0.0001165776,0.0003333081,0.0001567431,0.6446295,0.006841354,0.03757748,0.008133138,0.3007519],"study_design_scores_gemma":[0.00007256122,0.000157018,0.000190351,0.00005173096,0.00003490259,0.0003075884,0.00006574956,0.9706174,0.004082175,0.009838227,0.01453899,0.00004341853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007255167,0.0007992729,0.987308,0.00009753103,0.0001787107,0.0001145604,0.00004498387,0.0002725846,0.00392927],"genre_scores_gemma":[0.08146801,0.0007532184,0.9138815,0.0001318751,0.00008933296,0.0002763267,0.0001841597,0.0000955435,0.003120039],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002823632,"threshold_uncertainty_score":0.009445965,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0191187641396252,"score_gpt":0.2262011737155466,"score_spread":0.2070824095759214,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}