{"id":"W1972661641","doi":"10.1002/net.20099","title":"The multiroute maximum flow problem revisited","year":2005,"lang":"en","type":"article","venue":"Networks","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Maximum flow problem; Flow network; Vertex (graph theory); Flow (mathematics); Combinatorics; Disjoint sets; Mathematics; Path (computing); Arc (geometry); Multi-commodity flow problem; Minimum-cost flow problem; Integer programming; Mathematical optimization; Computer science; Graph","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.001578436,0.0007204442,0.00126734,0.0009586256,0.0007008133,0.001492261,0.001595926,0.001799415,0.005814582],"category_scores_gemma":[0.006520377,0.0005411255,0.000658958,0.001300165,0.001095281,0.003318929,0.001321645,0.00155522,0.0004282619],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001375766,"about_ca_system_score_gemma":0.0008746181,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002170411,"about_ca_topic_score_gemma":0.00207504,"domain_scores_codex":[0.9986401,0.0007154591,0.00004054616,0.0002331682,0.000209163,0.0001614605],"domain_scores_gemma":[0.9964085,0.002712626,0.000334645,0.0001985423,0.0002069947,0.000138603],"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.0002614705,0.0001801622,0.0008329727,0.0004108449,0.00006742817,0.0003558943,0.0002267503,0.6921712,0.001233997,0.2090727,0.007486448,0.08770015],"study_design_scores_gemma":[0.00007310779,0.00004755723,0.0002671858,0.00003116298,0.00001492771,0.0002110706,0.00005538375,0.8388225,0.0007519532,0.1544071,0.005304244,0.00001376996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1099164,0.001187086,0.8700362,0.002384492,0.0001172287,0.0001931867,0.0003591862,0.0004434053,0.01536284],"genre_scores_gemma":[0.6444521,0.00100855,0.343343,0.000299284,0.0002193359,0.0003340077,0.0005488414,0.0001876408,0.009607235],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005814582,"threshold_uncertainty_score":0.01945174,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01131194124672325,"score_gpt":0.2260950382719837,"score_spread":0.2147830970252605,"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."}}