{"id":"W4401813867","doi":"10.1007/s10107-024-02133-9","title":"A fast combinatorial algorithm for the bilevel knapsack problem with interdiction constraints","year":2024,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Knapsack problem; Interdiction; Continuous knapsack problem; Bilevel optimization; Mathematical optimization; Change-making problem; Relaxation (psychology); Mathematics; Cutting stock problem; Algorithm; Generalized assignment problem; Integer programming; Computer science; Combinatorial optimization; Dynamic programming; Linear programming relaxation; Optimization problem","routes":{"ca_aff":true,"ca_fund":true,"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":[],"consensus_categories":[],"category_scores_codex":[0.0006202724,0.0001684596,0.0001508706,0.00009824341,0.0002312547,0.0007259995,0.0001845519,0.00004375702,0.0003359684],"category_scores_gemma":[0.00005572894,0.0001012569,0.00009536708,0.000374932,0.0001649306,0.000401827,0.00009260069,0.0001266963,0.0003592132],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000335782,"about_ca_system_score_gemma":0.00001689812,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003819618,"about_ca_topic_score_gemma":0.00001706602,"domain_scores_codex":[0.9988577,0.000006117771,0.0003019104,0.00027603,0.000271195,0.0002870353],"domain_scores_gemma":[0.9995658,0.0000886959,0.00003633755,0.0001819629,0.0001122284,0.0000150206],"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.000009678781,0.0001084281,0.000006590663,0.00090888,0.00008933295,0.000002270016,0.0001348718,0.00003473478,0.000003274374,0.2699422,0.001437268,0.7273225],"study_design_scores_gemma":[0.0005783933,0.00005466597,0.000018501,0.0003457052,0.0002220446,0.000005621504,0.001194533,0.671707,0.000009929659,0.05898475,0.2666112,0.0002675633],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0003760619,0.0000575271,0.9886929,0.002317192,0.0008027987,0.001751044,0.000003692671,0.0004360487,0.005562759],"genre_scores_gemma":[0.9036565,0.000005814013,0.08929101,0.0006717737,0.002157674,0.002351134,0.00008463594,0.0001052026,0.001676227],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9032804,"threshold_uncertainty_score":0.700083,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0239749780700208,"score_gpt":0.2525837451105655,"score_spread":0.2286087670405447,"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."}}