{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002502932,0.0002789145,0.0003062761,0.00009857144,0.0004356187,0.0002754313,0.00009141726,0.0001301362,0.00002046776],"category_scores_gemma":[0.000002516776,0.0002230181,0.00007170629,0.00008560358,0.00005409768,0.0001012664,0.000001916399,0.0001957161,0.00002403849],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004231683,"about_ca_system_score_gemma":0.00002109289,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001936207,"about_ca_topic_score_gemma":0.0002647657,"domain_scores_codex":[0.9986599,0.00004306324,0.0004865977,0.000294601,0.000197048,0.0003187842],"domain_scores_gemma":[0.9992392,0.0001929473,0.000077263,0.0002375804,0.00007276797,0.0001802287],"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.0000194969,0.00005569378,0.00001737405,0.0006538345,0.0001708807,0.000001107537,0.003493083,0.9805105,0.0004269357,0.00385735,0.008204101,0.002589655],"study_design_scores_gemma":[0.001337075,0.0001226749,0.00003865901,0.000517885,0.0001271857,0.00005108118,0.0005483868,0.7411802,0.0001213483,0.00001808185,0.2555105,0.00042689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0134039,0.004596359,0.9735869,0.0002642927,0.002570367,0.00265719,0.0001318272,0.0004926989,0.002296489],"genre_scores_gemma":[0.9868841,0.0003647747,0.001897672,0.00004187442,0.0004009341,0.0002352938,0.000007014183,0.00006910877,0.01009926],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9734802,"threshold_uncertainty_score":0.9094412,"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."}}