{"id":"W2086681505","doi":"10.5539/jmr.v2n1p28","title":"Applications of Maximal Network Flow Problems in Transportation and Assignment Problems","year":2010,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Flow network; Flow (mathematics); Mathematical optimization; Transportation theory; Dual (grammatical number); Assignment problem; Process (computing); Tree (set theory); Algorithm; Combinatorics; Computer science","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"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.003118452,0.001394197,0.001018935,0.001293257,0.001248503,0.001130413,0.001645861,0.001707956,0.005287239],"category_scores_gemma":[0.00704845,0.0006697359,0.001639893,0.002248292,0.001916663,0.002610561,0.002447725,0.003229725,0.0006350066],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001812912,"about_ca_system_score_gemma":0.001289992,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002144347,"about_ca_topic_score_gemma":0.002195653,"domain_scores_codex":[0.9977453,0.001303084,0.00008809707,0.000282943,0.0004530467,0.0001274406],"domain_scores_gemma":[0.9977722,0.001761675,0.00009030914,0.0001400094,0.0001643274,0.00007152181],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007187844,0.00009450062,0.0003534719,0.0004184629,0.0000603735,0.0001231935,0.0002619606,0.1999693,0.001544719,0.6566489,0.005544856,0.1349083],"study_design_scores_gemma":[0.000024617,0.00004086502,0.0001587638,0.00008680157,0.00002202859,0.0001282678,0.00006582294,0.3063234,0.001444391,0.6591373,0.03254373,0.0000239921],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003241136,0.002165721,0.9820886,0.0007778649,0.0001651576,0.00004430116,0.00003592989,0.00007567252,0.01140563],"genre_scores_gemma":[0.2211134,0.006416974,0.7616489,0.0004142674,0.001026036,0.0002879095,0.0002061744,0.000170944,0.008715403],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005287239,"threshold_uncertainty_score":0.01768756,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05344592199758834,"score_gpt":0.3683133832193372,"score_spread":0.3148674612217488,"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."}}