{"id":"W4400102744","doi":"10.1007/978-3-031-57603-4_2","title":"Variable Neighborhood Search with Dynamic Exploration for the Set Union Knapsack Problem","year":2024,"lang":"en","type":"book-chapter","venue":"International series in management science/operations research/International series in operations research & management science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Knapsack problem; Set (abstract data type); Variable (mathematics); Mathematical optimization; Variable neighborhood search; Computer science; Mathematics; Metaheuristic","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":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["sts","scholarly_communication"],"category_scores_codex":[0.02477899,0.000718707,0.0004601841,0.01081322,0.004605773,0.01280932,0.01318094,0.0002134942,0.0007365133],"category_scores_gemma":[0.0005002444,0.0005910134,0.0001369762,0.008561664,0.006671232,0.01447182,0.007464379,0.002120923,0.000390557],"about_ca_system_candidate":true,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004869504,"about_ca_system_score_gemma":0.001773879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004594605,"about_ca_topic_score_gemma":0.004855275,"domain_scores_codex":[0.981513,0.0003759621,0.001523381,0.003251985,0.01118546,0.002150191],"domain_scores_gemma":[0.9913306,0.0004508851,0.0001007891,0.002184787,0.005553333,0.0003795612],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008940423,0.0001451582,0.00001130023,0.0001030092,0.0001162517,0.00006780808,0.000964496,0.3179335,0.00009783898,0.676275,0.0008318282,0.003364466],"study_design_scores_gemma":[0.0009652756,0.0003965013,0.000135024,0.0008879046,0.00001718887,0.00003501874,0.003443693,0.7366066,0.00008915941,0.1128865,0.1438239,0.0007132858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00005462407,0.0002054439,0.2956712,0.0685188,0.002458355,0.009840022,0.0002214647,0.0002587232,0.6227714],"genre_scores_gemma":[0.05010992,0.008577324,0.1505016,0.0002839697,0.0003185822,0.006490878,0.0006371928,0.00015377,0.7829268],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.5633885,"threshold_uncertainty_score":0.9996541,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06572608255923652,"score_gpt":0.390406210656741,"score_spread":0.3246801280975045,"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."}}