{"id":"W3213436692","doi":"10.5267/j.dsl.2021.8.004","title":"Binary social group optimization algorithm for solving 0-1 knapsack problem","year":2021,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Knapsack problem; Continuous knapsack problem; Binary number; Algorithm; Mathematical optimization; Optimization problem; Group (periodic table); Mathematics; Transformation (genetics); Continuous optimization; Polynomial-time approximation scheme; Computer science; Multi-swarm optimization","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002572438,0.0001986468,0.0002543025,0.0005632506,0.00120245,0.001496111,0.002034988,0.0000737861,0.00009696405],"category_scores_gemma":[0.0008659185,0.0001922776,0.000125701,0.00401996,0.0003625161,0.001965578,0.0008972154,0.000186805,0.00005023877],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001889642,"about_ca_system_score_gemma":0.0003693271,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002930522,"about_ca_topic_score_gemma":5.358833e-7,"domain_scores_codex":[0.9955184,0.00009273006,0.0005104959,0.001168878,0.001952577,0.0007568446],"domain_scores_gemma":[0.9974583,0.0005606751,0.0001699056,0.0007030718,0.0008741937,0.0002338622],"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.00000892445,0.0001612346,0.00002807909,0.00001598028,0.00001383672,0.00009353665,0.0005948283,0.1009657,0.02020083,0.00612537,0.0160824,0.8557093],"study_design_scores_gemma":[0.0005508484,0.00004009535,0.0001761543,0.00001909364,0.000004086834,0.00002856641,0.000038745,0.9939572,0.001486971,0.0008374486,0.002620043,0.0002406967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005730251,0.00003821414,0.9911454,0.006666246,0.00079721,0.0004028241,0.000008539335,0.000138121,0.0002304559],"genre_scores_gemma":[0.001529933,0.00001808248,0.9953968,0.002652195,0.0001674153,0.00006417079,0.00001631368,0.0000188289,0.0001362568],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8929915,"threshold_uncertainty_score":0.9995404,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02989943379466336,"score_gpt":0.3184086165866767,"score_spread":0.2885091827920134,"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."}}