{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007816342,0.002587078,0.002219348,0.001847856,0.001424478,0.003121507,0.003242779,0.002570891,0.01913033],"category_scores_gemma":[0.003304564,0.001466689,0.00177889,0.004266753,0.0008541213,0.003656162,0.003111368,0.00388928,0.006104852],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001337039,"about_ca_system_score_gemma":0.002228622,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005666694,"about_ca_topic_score_gemma":0.005809774,"domain_scores_codex":[0.9990929,0.0001673659,0.00004682769,0.0002276957,0.000325355,0.0001398545],"domain_scores_gemma":[0.9988397,0.0006183268,0.00005330309,0.0001750435,0.0002513126,0.00006227504],"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.0002776561,0.0003681275,0.0002268954,0.0003639877,0.00007588424,0.0001443877,0.00008213137,0.3596769,0.00418101,0.06627727,0.02342576,0.5449],"study_design_scores_gemma":[0.0001506499,0.00008111179,0.0001156063,0.00004703747,0.00002435399,0.0001015131,0.00003953574,0.9260952,0.001313572,0.06224327,0.009754685,0.00003342133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002957584,0.0002971742,0.9870826,0.0001295956,0.0001495319,0.0001090298,0.0001659917,0.001161674,0.007946705],"genre_scores_gemma":[0.03001146,0.0003596067,0.9617837,0.0001242792,0.00009103135,0.000380297,0.0008012727,0.0005774089,0.005871029],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01913033,"threshold_uncertainty_score":0.06399727,"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."}}