{"id":"W2110438635","doi":"10.1287/ijoc.1060.0191","title":"Solving the Bi-Objective Maximum-Flow Network-Interdiction Problem","year":2007,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Infrastructure Resilience and Vulnerability Analysis","field":"Engineering","cited_by":125,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Office of Naval Research; McGill University","keywords":"Interdiction; Lagrangian relaxation; Mathematical optimization; Solver; Flow network; Maximum flow problem; Branch and bound; Minimum-cost flow problem; Integer programming; Flow (mathematics); Set (abstract data type); Computer science; Pareto principle; Branch and cut; Relaxation (psychology); Linear programming relaxation; Integer (computer science); Mathematics; Algorithm","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001134531,0.001220285,0.001180373,0.0008887867,0.0006679622,0.001108132,0.001674332,0.001271816,0.007588567],"category_scores_gemma":[0.002515632,0.0005305283,0.0006967153,0.001190262,0.0005708174,0.001724339,0.001439519,0.001625297,0.001046449],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008237672,"about_ca_system_score_gemma":0.001965148,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003978888,"about_ca_topic_score_gemma":0.004513437,"domain_scores_codex":[0.9994635,0.0001672983,0.00002121986,0.000103127,0.0001487822,0.00009605339],"domain_scores_gemma":[0.9992675,0.0004450755,0.00006812598,0.00006726195,0.0001119591,0.00004003423],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007770361,0.00007593213,0.0003358382,0.0001539146,0.00004084435,0.00006457306,0.00006306111,0.8797067,0.001030601,0.03255647,0.004122239,0.08177217],"study_design_scores_gemma":[0.00002021086,0.00002387905,0.00006982843,0.00001128786,0.000006792093,0.00003449007,0.00001916798,0.9824371,0.0006688594,0.01488661,0.001815825,0.000005984822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005880706,0.0001213882,0.988475,0.0001250119,0.00002419565,0.00005815135,0.0001091658,0.0002663827,0.004940046],"genre_scores_gemma":[0.11895,0.0001979565,0.8760859,0.00008365522,0.00002765266,0.0002848682,0.0004662671,0.0001504657,0.003753104],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007588567,"threshold_uncertainty_score":0.02538627,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005485217191066163,"score_gpt":0.2239149665857092,"score_spread":0.218429749394643,"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."}}