{"id":"W4377200034","doi":"10.1007/978-3-031-32726-1_31","title":"A Fast Combinatorial Algorithm for the Bilevel Knapsack Problem with Interdiction Constraints","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Interdiction; Knapsack problem; Bilevel optimization; Computer science; Algorithm; Mathematical optimization; Mathematics; Optimization problem; Engineering","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"],"consensus_categories":[],"category_scores_codex":[0.001482295,0.0006433497,0.0005898295,0.0006310176,0.0005661254,0.0008157094,0.003777815,0.0003420257,0.000004973636],"category_scores_gemma":[0.00008579572,0.0004401172,0.0001513825,0.0008804797,0.001601937,0.0004723757,0.001073417,0.0009841584,0.00004803412],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003173513,"about_ca_system_score_gemma":0.0009017735,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002232991,"about_ca_topic_score_gemma":0.00001325263,"domain_scores_codex":[0.9955551,0.00004174532,0.0005770184,0.00170105,0.001238407,0.000886699],"domain_scores_gemma":[0.995939,0.001672791,0.0004121566,0.001339626,0.0004638439,0.0001725724],"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.000006895453,0.00002219763,0.000006502338,0.00002601035,0.00004349636,0.00006732596,0.0007714884,0.03672194,0.000007042693,0.01103577,0.0000824074,0.9512089],"study_design_scores_gemma":[0.0007541684,0.0005011818,0.00004436568,0.0006138171,0.00002284878,0.0001962039,8.678962e-7,0.9057319,0.0001097432,0.09101421,0.0004405289,0.0005701821],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000001065889,0.00006437819,0.9898393,0.0008911755,0.006656975,0.001395087,0.00003835966,0.0004103719,0.000703294],"genre_scores_gemma":[0.001707455,0.00001331839,0.9961094,0.000441659,0.0009935583,0.0001091859,0.00001462216,0.00007188277,0.0005389319],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9506387,"threshold_uncertainty_score":0.999805,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0217922625050534,"score_gpt":0.2494158704108485,"score_spread":0.2276236079057951,"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."}}