{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002608342,0.0001369907,0.0001294619,0.0001536599,0.001892244,0.001361857,0.001352027,0.00005381562,0.00007348356],"category_scores_gemma":[0.0008517723,0.00009483849,0.00007411838,0.0005961963,0.0002254182,0.0007160627,0.0002429812,0.0004824053,0.0003456317],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001202785,"about_ca_system_score_gemma":0.0001403716,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001626714,"about_ca_topic_score_gemma":0.0003590237,"domain_scores_codex":[0.9971449,0.0008655532,0.0002187529,0.0004565695,0.0007381514,0.0005760718],"domain_scores_gemma":[0.9975804,0.0008964468,0.00001866065,0.0009978486,0.0003808529,0.000125754],"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.000024131,0.0003959406,0.0000234753,0.00003323665,0.00004560646,0.000004936468,0.006673654,0.3047607,0.01608669,0.4182675,0.249847,0.003837178],"study_design_scores_gemma":[0.0005347258,0.0001192085,0.0000493605,0.00001405307,0.000001065847,0.000001283455,0.00005305226,0.8809648,0.001001124,0.0002659158,0.1168755,0.0001199609],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01841068,0.000009813156,0.8574906,0.1213741,0.0002960552,0.001221516,0.00001893361,0.0000703226,0.001107954],"genre_scores_gemma":[0.7341527,0.00006090389,0.2265861,0.02838549,0.0007670646,0.001111902,0.0001336884,0.00007355413,0.008728599],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.715742,"threshold_uncertainty_score":0.9996748,"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."}}