{"id":"W2006228567","doi":"10.1287/moor.25.1.76.15208","title":"Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow","year":2000,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Minimum-cost flow problem; Flow (mathematics); Algorithm; Mathematical optimization; Flow network; Geometry","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":[],"consensus_categories":[],"category_scores_codex":[0.001016963,0.0001401166,0.0002472477,0.0002212224,0.0008007614,0.0003353326,0.0006399124,0.00006858793,0.00007824442],"category_scores_gemma":[0.000382446,0.0001326448,0.00004894305,0.0009106231,0.0003157021,0.0004436187,0.0002118683,0.0002519645,0.0000172995],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005615319,"about_ca_system_score_gemma":0.0002041139,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002397656,"about_ca_topic_score_gemma":0.0002318345,"domain_scores_codex":[0.9982399,0.0001051097,0.0003827409,0.0003660302,0.0005162712,0.0003898878],"domain_scores_gemma":[0.9976473,0.0009108308,0.00003106938,0.0005011095,0.0007879509,0.0001217295],"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.00006884077,0.001594036,0.00001965989,0.0004296516,0.0002525122,0.0000232321,0.05064179,0.03522607,0.003815277,0.3554194,0.003317039,0.5491925],"study_design_scores_gemma":[0.0004858135,0.0001760757,0.00002844319,0.0001112528,0.000005678319,0.00001263736,0.0006069739,0.9631655,0.00571535,0.02922961,0.0003182524,0.0001443994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0789988,0.0002319233,0.9102162,0.002249811,0.0001188688,0.002429957,0.0003635733,0.00007982978,0.005311078],"genre_scores_gemma":[0.07049601,0.000159813,0.9272608,0.00006380025,0.00007669348,0.0003136988,0.0000259687,0.00002142185,0.001581818],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9279394,"threshold_uncertainty_score":0.615889,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08106170843672988,"score_gpt":0.3754496383923113,"score_spread":0.2943879299555814,"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."}}