{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006557073,0.0006519349,0.0010182,0.0006704317,0.0004892393,0.0008195325,0.001311607,0.001044889,0.00459047],"category_scores_gemma":[0.002026094,0.0004084226,0.0006420332,0.00140103,0.000621673,0.001445301,0.001606428,0.001664907,0.0004969088],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005018222,"about_ca_system_score_gemma":0.0005724421,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002117021,"about_ca_topic_score_gemma":0.002193144,"domain_scores_codex":[0.9996101,0.000157054,0.00001056924,0.00005183772,0.0001312426,0.00003922534],"domain_scores_gemma":[0.9996394,0.0002613494,0.00002434227,0.00002254332,0.00003211449,0.00002038524],"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.0001281968,0.0001145921,0.0002126318,0.0001423722,0.00003911835,0.000055596,0.00007761428,0.8032554,0.001533332,0.06589002,0.005780761,0.1227704],"study_design_scores_gemma":[0.00001533784,0.00005196573,0.00006155554,0.00001586842,0.000006514474,0.00002483952,0.00001279347,0.9796622,0.0002260705,0.01801347,0.001902735,0.000006669519],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02637113,0.002012847,0.9517194,0.0003106742,0.0001822514,0.00007345583,0.00008037731,0.0001835537,0.01906635],"genre_scores_gemma":[0.4444545,0.002034115,0.5246516,0.0001980703,0.0002351628,0.0004906738,0.0003385123,0.0003054825,0.02729192],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00459047,"threshold_uncertainty_score":0.01535672,"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."}}