{"id":"W3187917979","doi":"10.1016/j.cor.2021.105511","title":"The transit time constrained fixed charge multi-commodity network design problem","year":2021,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Urban and Freight Transport Logistics","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":false,"ca_institutions":"HEC Montréal; Group for Research in Decision Analysis; Concordia University","funders":"","keywords":"Solver; Fixed charge; Mathematical optimization; Network planning and design; Flow network; Computer science; Path (computing); Set (abstract data type); Integer programming; Integer (computer science); Commodity; Mathematics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001487127,0.001447314,0.001453473,0.0008693169,0.0007141202,0.002205779,0.002041072,0.002724713,0.009673295],"category_scores_gemma":[0.00389788,0.001009403,0.0009674693,0.001487872,0.0009095381,0.002149653,0.001092429,0.001252549,0.0004793689],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002113043,"about_ca_system_score_gemma":0.002264692,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005591341,"about_ca_topic_score_gemma":0.005642141,"domain_scores_codex":[0.9991938,0.0003334676,0.00002261668,0.0001850676,0.0001313142,0.0001337191],"domain_scores_gemma":[0.9987877,0.000780921,0.00009810023,0.00005651891,0.0001468667,0.0001298433],"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.0001557282,0.00009230096,0.0003627696,0.0002201104,0.00005217317,0.0001840532,0.00005128569,0.9468485,0.0007746217,0.02334427,0.003650091,0.02426407],"study_design_scores_gemma":[0.00008286771,0.0001561344,0.0001912996,0.0000257036,0.00004219877,0.00009410096,0.00005566282,0.9679233,0.0005138544,0.02784573,0.003053301,0.00001583062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0960223,0.001085513,0.8678939,0.001953347,0.0003154422,0.0004990837,0.0009700868,0.000267889,0.03099241],"genre_scores_gemma":[0.8403561,0.001082038,0.1323127,0.0003427575,0.000182538,0.0003795098,0.0005726007,0.0001806589,0.0245911],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009673295,"threshold_uncertainty_score":0.03236037,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1085132087749521,"score_gpt":0.2885765261306434,"score_spread":0.1800633173556913,"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."}}