{"id":"W2468155677","doi":"10.1287/trsc.2015.0634","title":"Reformulations by Discretization for Piecewise Linear Integer Multicommodity Network Flow Problems","year":2016,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal","funders":"","keywords":"Discretization; Mathematical optimization; Integer programming; Flow network; Lagrangian relaxation; Multi-commodity flow problem; Piecewise linear function; Mathematics; Flow (mathematics); Linear programming relaxation; Relaxation (psychology); Integer (computer science); Linear programming; Constraint (computer-aided design); Set (abstract data type); Branch and cut; Computer science","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007311869,0.000121024,0.0001170314,0.00007867015,0.0002288851,0.00003490835,0.0001999424,0.00005604911,0.00003138757],"category_scores_gemma":[0.0001119149,0.00009178191,0.00004044587,0.0006797738,0.000142386,0.0007145714,0.000003007565,0.00005440154,0.000007024079],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008545324,"about_ca_system_score_gemma":0.00003881785,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003925531,"about_ca_topic_score_gemma":0.00002386725,"domain_scores_codex":[0.9988308,0.00001789091,0.0003424199,0.0002507638,0.0002593317,0.0002987849],"domain_scores_gemma":[0.9992706,0.0001307093,0.00006250358,0.000207143,0.0002276045,0.0001014956],"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.00000501754,0.00001065235,0.002839682,0.00001988011,0.000003738498,5.262411e-8,0.0003504036,0.9718738,0.01519269,0.0008850663,0.0002021689,0.008616858],"study_design_scores_gemma":[0.0004453306,0.00001715154,0.006346729,0.00005101881,0.0000120382,2.121258e-7,0.00001551283,0.984517,0.005636516,0.0005231739,0.002259998,0.0001753385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02728154,0.000020686,0.9712254,0.0002320037,0.0002590833,0.0003937459,0.000118814,0.0003361315,0.0001325519],"genre_scores_gemma":[0.7555876,0.00001899937,0.2440423,0.00002578484,0.00005371799,0.00006332139,0.00008827475,0.00002279418,0.00009713558],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7283061,"threshold_uncertainty_score":0.3742757,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02052542492325667,"score_gpt":0.2780080266119627,"score_spread":0.2574826016887061,"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."}}