{"id":"W2088456596","doi":"10.1016/j.orl.2014.12.008","title":"A tight bound on the speed-up through storage for quickest multi-commodity flows","year":2014,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"University of British Columbia; Deutsche Forschungsgemeinschaft","keywords":"Upper and lower bounds; Computer science; Speedup; Commodity; Parallel computing; Mathematics; Mathematical optimization; Simulation; Business; Mathematical analysis","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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.009013445,0.005257071,0.006001925,0.003783969,0.003299172,0.008695236,0.00615585,0.005187835,0.03039831],"category_scores_gemma":[0.06829456,0.002611017,0.002505337,0.006775409,0.005056615,0.02129648,0.007304707,0.009042829,0.00380702],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003858197,"about_ca_system_score_gemma":0.005836687,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003579306,"about_ca_topic_score_gemma":0.003388254,"domain_scores_codex":[0.9942697,0.001170189,0.0002450335,0.001018708,0.001087724,0.002208663],"domain_scores_gemma":[0.9464102,0.04208922,0.001722202,0.005230178,0.002653646,0.001894576],"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.004131096,0.0005428313,0.001907597,0.002954197,0.0003058214,0.0004774014,0.0006120673,0.5783427,0.01768308,0.1890387,0.06052795,0.1434765],"study_design_scores_gemma":[0.000155329,0.0003241729,0.0008292136,0.0004701385,0.0002128551,0.0004271028,0.0002348867,0.7687767,0.00747552,0.2140881,0.006885524,0.0001205579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1280655,0.02743323,0.7467665,0.01475673,0.003229147,0.0006058146,0.004592195,0.005026421,0.06952453],"genre_scores_gemma":[0.7620475,0.01236873,0.1894475,0.003139042,0.002382382,0.0008507399,0.001535596,0.002799767,0.02542874],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03039831,"threshold_uncertainty_score":0.1016925,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1471800480679098,"score_gpt":0.3804564062101811,"score_spread":0.2332763581422713,"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."}}