{"id":"W2091480483","doi":"10.5539/cis.v8n2p1","title":"Comparing Algorithms for Minimizing Congestion and Cost in the Multi-Commodity k-Splittable Flow","year":2015,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"National Natural Science Foundation of China; Chinese Academy of Sciences; National Science Foundation","keywords":"Computer science; Heuristic; Minimum-cost flow problem; Mathematical optimization; Flow network; Key (lock); Flow (mathematics); Algorithm; Point (geometry); Network congestion; Commodity; Mathematics; Computer network; Economics; Network packet; Artificial intelligence; Computer security","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001687258,0.00005936252,0.00007884466,0.0001106734,0.0001237831,0.0002912354,0.0001288867,0.00002203824,2.11053e-7],"category_scores_gemma":[0.00008239545,0.00004853855,0.000006244172,0.0002741426,0.00008267658,0.00238525,0.00004808788,0.00006321217,0.000001194231],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003411551,"about_ca_system_score_gemma":0.00001951602,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005058072,"about_ca_topic_score_gemma":0.000001390243,"domain_scores_codex":[0.9994726,0.00002049812,0.0001764211,0.00006879261,0.0001276978,0.0001339734],"domain_scores_gemma":[0.9996393,0.00009017693,0.00002874572,0.00008540139,0.0001004055,0.00005599756],"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.000002591086,0.000004892554,0.002764644,0.00002985252,0.000001071066,6.153738e-8,0.005820413,0.8795624,0.00001003191,0.0005126431,0.0002055284,0.1110858],"study_design_scores_gemma":[0.0005394174,0.00001158856,0.01356878,0.00001360854,0.000001317447,0.000007259954,0.0002094629,0.9831348,0.00005433547,0.00002263744,0.002372644,0.00006415128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04332912,0.00002850164,0.9557568,0.00006050727,0.0002160539,0.0002272446,0.000002656744,0.00004970396,0.0003293512],"genre_scores_gemma":[0.4776662,0.00001102542,0.5221326,0.0001404313,0.00002465197,0.00001506954,0.000006922155,0.000002151333,9.715874e-7],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.434337,"threshold_uncertainty_score":0.280839,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09686624956856517,"score_gpt":0.3138079726063005,"score_spread":0.2169417230377353,"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."}}