{"id":"W2590432748","doi":"10.1007/s00521-017-2903-1","title":"Multi-strategy monarch butterfly optimization algorithm for discounted {0-1} knapsack problem","year":2017,"lang":"en","type":"article","venue":"Neural Computing and Applications","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Knapsack problem; Computer science; Algorithm; Mathematical optimization; Continuous knapsack problem; Combinatorial optimization; Mathematics","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":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003523998,0.0001703162,0.00018561,0.00009496635,0.001666397,0.001133251,0.001084059,0.00006487819,0.000004240291],"category_scores_gemma":[0.00005996313,0.0001614904,0.00004937114,0.0001764105,0.0001430061,0.0003808891,0.0004166423,0.0001714018,0.000007533322],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002262852,"about_ca_system_score_gemma":0.00005566519,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002764457,"about_ca_topic_score_gemma":0.000001971016,"domain_scores_codex":[0.9984383,0.00005491336,0.0003111602,0.0006074634,0.0002396504,0.0003485076],"domain_scores_gemma":[0.9982846,0.0001724464,0.000232506,0.0008132961,0.0003459186,0.000151204],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002990415,0.0001479525,0.0002674037,0.00004763008,0.00002189328,0.000001717521,0.000107961,0.1675252,0.0002055574,0.007101892,0.0002465285,0.8243233],"study_design_scores_gemma":[0.0005504216,0.00004877868,0.001181845,0.00001107391,0.000007130957,0.00001202577,0.00001282327,0.9964091,0.00009202836,0.0003858352,0.00111595,0.0001730027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002021292,0.0000538927,0.9967317,0.0013217,0.00006800552,0.001097058,0.00002985493,0.0001648395,0.0003308277],"genre_scores_gemma":[0.08242583,0.00002717693,0.9162087,0.00008443867,0.0001694255,0.0002339348,0.0000490501,0.00001902196,0.0007824336],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8288839,"threshold_uncertainty_score":0.9999037,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05245572999880233,"score_gpt":0.3589807300846393,"score_spread":0.3065250000858369,"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."}}