{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002175484,0.001394834,0.001157809,0.001555556,0.001004837,0.001366647,0.002336978,0.000899371,0.007226764],"category_scores_gemma":[0.007932363,0.0005398351,0.001230707,0.001921556,0.001215761,0.003481379,0.002031401,0.0022845,0.001100181],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001390024,"about_ca_system_score_gemma":0.001537056,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002236544,"about_ca_topic_score_gemma":0.002386109,"domain_scores_codex":[0.9977421,0.0006238528,0.000161319,0.0003602356,0.0009014066,0.0002111535],"domain_scores_gemma":[0.9966418,0.001506498,0.0002910329,0.000828404,0.0005683393,0.0001639349],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00037151,0.0002269546,0.001084118,0.0002859715,0.00005905533,0.00006592228,0.0002325987,0.159663,0.008444902,0.1811365,0.01077325,0.6376563],"study_design_scores_gemma":[0.0001268222,0.0001732926,0.0005259626,0.00004131292,0.00004790129,0.0001757589,0.00006984769,0.7913694,0.009946956,0.1791188,0.01835159,0.00005226059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01187429,0.0002956488,0.9810489,0.0002055983,0.00006784556,0.0001194446,0.00007319014,0.000980634,0.005334442],"genre_scores_gemma":[0.1267199,0.0003246372,0.8671579,0.0002474188,0.0001408938,0.0003136535,0.000449912,0.000591935,0.004053864],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007226764,"threshold_uncertainty_score":0.02417594,"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."}}