{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000766429,0.0008208151,0.00126838,0.0008043886,0.0007808134,0.001211901,0.001640096,0.001599026,0.004051097],"category_scores_gemma":[0.001246301,0.0005031521,0.0005859494,0.0008170938,0.000574747,0.0008096668,0.001121357,0.000961845,0.0003961411],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001438206,"about_ca_system_score_gemma":0.002039693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01051207,"about_ca_topic_score_gemma":0.01280602,"domain_scores_codex":[0.9997259,0.0000614556,0.00001263666,0.00004507479,0.00008374636,0.00007118967],"domain_scores_gemma":[0.9997033,0.0001497507,0.0000332987,0.00001868235,0.00006263152,0.00003226187],"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.0001305606,0.00006527497,0.0002952902,0.00006157484,0.00004068909,0.00006137773,0.00003664018,0.9443138,0.00107203,0.01176397,0.001807115,0.04035165],"study_design_scores_gemma":[0.00001327106,0.00002683872,0.00004954475,0.000005321084,0.000005816416,0.000008453962,0.000006744383,0.9974043,0.0001649996,0.002065374,0.0002454123,0.00000383385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05799582,0.0006579497,0.9248433,0.0005372839,0.0001664716,0.000115914,0.0001157136,0.0003927112,0.01517476],"genre_scores_gemma":[0.7522278,0.0003274222,0.2310517,0.0003030689,0.00006225164,0.0002617919,0.0001967833,0.00009816598,0.01547099],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01051207,"threshold_uncertainty_score":0.0209018,"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."}}