{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003849831,0.001620479,0.0017308,0.002290757,0.001018536,0.001459849,0.002222325,0.002068547,0.002370743],"category_scores_gemma":[0.008592229,0.0005447392,0.001404157,0.002663384,0.001150596,0.003175098,0.0009504044,0.001132305,0.0002411643],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003126036,"about_ca_system_score_gemma":0.002799524,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0058498,"about_ca_topic_score_gemma":0.004729891,"domain_scores_codex":[0.9982687,0.0007240017,0.0001216366,0.0002296757,0.0003368366,0.0003191432],"domain_scores_gemma":[0.9927514,0.005444084,0.0004567197,0.0004808136,0.0006085968,0.0002584322],"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.0006024483,0.0002666631,0.001075903,0.0002430462,0.0001009898,0.00002341662,0.0000766943,0.9329671,0.0007224644,0.008005896,0.001145422,0.05477001],"study_design_scores_gemma":[0.0001173003,0.0002198683,0.0005665333,0.00002214243,0.00003753222,0.00002856063,0.00008221091,0.992533,0.0009485557,0.005022295,0.0004046414,0.00001741274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4795805,0.003821292,0.5010679,0.0007288655,0.0003217391,0.0006083538,0.0003912357,0.001141792,0.01233834],"genre_scores_gemma":[0.6835279,0.001302297,0.3126202,0.0001583291,0.00005671196,0.0003584018,0.000468172,0.0002059604,0.001301899],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0058498,"threshold_uncertainty_score":0.02268112,"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."}}