{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001156599,0.0008880838,0.0008318207,0.001016677,0.000654134,0.0007240708,0.001085502,0.00108922,0.003793681],"category_scores_gemma":[0.001891139,0.0002638139,0.000566061,0.001038974,0.0005704986,0.001024341,0.001117251,0.0008964882,0.0008147481],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004859829,"about_ca_system_score_gemma":0.001015906,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002368452,"about_ca_topic_score_gemma":0.001880604,"domain_scores_codex":[0.999046,0.0003515602,0.00004197927,0.0001031974,0.0003617861,0.00009543404],"domain_scores_gemma":[0.9995592,0.0001802727,0.00006865866,0.00003614381,0.0001277901,0.00002801014],"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.0002820248,0.0002004086,0.001329931,0.0003640266,0.00009889039,0.00008574924,0.0001846843,0.6549748,0.005531036,0.05284913,0.006081715,0.2780176],"study_design_scores_gemma":[0.00006151855,0.0001306722,0.0002426923,0.00002726606,0.00001631071,0.00005042409,0.00004705361,0.9780683,0.00158562,0.01549968,0.004255273,0.00001528021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0124524,0.0003875805,0.9794993,0.0002098795,0.00009683415,0.0001171218,0.00004255251,0.0002170833,0.006977274],"genre_scores_gemma":[0.281779,0.0004761569,0.7102697,0.0002837036,0.00007306059,0.0005442303,0.0003068018,0.0001083627,0.006159097],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003793681,"threshold_uncertainty_score":0.01269114,"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."}}