{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001833341,0.0001857204,0.0001985882,0.0001644134,0.0007009645,0.0002286988,0.0002531888,0.00009031891,0.00003929716],"category_scores_gemma":[0.00004899492,0.0001163534,0.0001869508,0.0004657036,0.000046224,0.0003402082,0.00004558031,0.001032601,0.00002681805],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000256515,"about_ca_system_score_gemma":0.00002505262,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006561894,"about_ca_topic_score_gemma":0.00002132794,"domain_scores_codex":[0.9984206,0.00002414435,0.0005663949,0.0001095147,0.000328701,0.0005506607],"domain_scores_gemma":[0.9992388,0.0002302441,0.0001525033,0.0001642573,0.0001139681,0.000100151],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001329313,0.000003626977,0.000964475,0.000008511368,0.00006963105,0.000008387148,0.0006648437,0.7534615,0.00004085569,0.0001057932,0.0003777658,0.2442814],"study_design_scores_gemma":[0.0003228339,0.0001347807,0.01103537,0.000228092,0.00003903079,0.0004372338,0.0008514245,0.9770041,0.0008278425,0.004037084,0.004787827,0.0002943953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2061107,0.00009919414,0.7763115,0.00007603561,0.001090121,0.0001219365,5.159506e-7,0.000159665,0.0160304],"genre_scores_gemma":[0.9927152,0.00002055142,0.005553356,0.0002302784,0.001446794,6.064038e-7,0.000001248203,0.00001792582,0.00001403569],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7866045,"threshold_uncertainty_score":0.5391323,"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."}}