{"id":"W4327518366","doi":"10.1007/978-3-030-54621-2_739-1","title":"Bilevel Knapsack Problems","year":2023,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","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; Bilevel optimization; Computer science; Mathematics; Mathematical optimization; Optimization problem","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.0003233187,0.001864925,0.00153096,0.001035463,0.0007673531,0.004307301,0.001468846,0.001307542,0.04623803],"category_scores_gemma":[0.00135591,0.0007877328,0.0006585913,0.003523526,0.0008201435,0.002324447,0.001970292,0.002926075,0.02684989],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000668848,"about_ca_system_score_gemma":0.0009831707,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001068927,"about_ca_topic_score_gemma":0.001706487,"domain_scores_codex":[0.999574,0.00005653665,0.00002253832,0.00006876499,0.0002381049,0.00004013624],"domain_scores_gemma":[0.9997242,0.0001095611,0.00001770859,0.00004389003,0.00008302797,0.00002155502],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006739877,0.0001361935,0.0001401949,0.001007228,0.00004849003,0.0001423422,0.0001047987,0.05754928,0.002061149,0.3158296,0.1523972,0.4705162],"study_design_scores_gemma":[0.00002044437,0.00004633579,0.0001900159,0.0004847313,0.00002373313,0.0003289537,0.00009530853,0.07654866,0.001974843,0.3653513,0.5548938,0.00004177228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.002124496,0.02257768,0.4101014,0.00114738,0.001484494,0.00009663065,0.0008377984,0.001180907,0.5604492],"genre_scores_gemma":[0.04934759,0.04960878,0.2700201,0.001049147,0.001134781,0.0004460235,0.003596558,0.001535374,0.6232617],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.04623803,"threshold_uncertainty_score":0.1546816,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0298448764551417,"score_gpt":0.2409009152561241,"score_spread":0.2110560388009824,"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."}}