{"id":"W2108911946","doi":"10.1287/ijoc.2013.0550","title":"Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems","year":2013,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":258,"is_retracted":false,"has_abstract":true,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Vehicle routing problem; Mathematical optimization; Heuristic; Computer science; Routing (electronic design automation); Index (typography); Production (economics); Branch and cut; Algorithm; Order (exchange); Enumeration; Integer programming; Operations research; Mathematics; Economics","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.0008480389,0.0001478671,0.0001648379,0.000146012,0.0004954819,0.000253033,0.00005001009,0.00006844722,0.000002869488],"category_scores_gemma":[0.0003417741,0.0001308027,0.00002981127,0.0001141523,0.00003625707,0.0006793909,0.00004112873,0.0003276082,0.000001738606],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005595202,"about_ca_system_score_gemma":0.00001172839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006508903,"about_ca_topic_score_gemma":0.000001496994,"domain_scores_codex":[0.9990503,0.00002593935,0.0004057011,0.0001356933,0.0001209321,0.0002614694],"domain_scores_gemma":[0.9993364,0.0001822939,0.0001411519,0.00007133682,0.0001436081,0.0001252692],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005174528,0.00001148519,0.01232471,0.000134447,0.00005097962,3.366834e-7,0.003354513,0.4913399,0.001091643,0.000268518,0.00007746506,0.4913409],"study_design_scores_gemma":[0.000499277,0.00006207439,0.01357075,0.000197481,0.00001011877,0.0001166867,0.0001603873,0.9839265,0.0004406099,0.0006668238,0.0001804233,0.0001689157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.678395,0.0001155465,0.3204764,0.0001484444,0.0002494594,0.0003677779,8.100854e-7,0.0001201891,0.0001264163],"genre_scores_gemma":[0.8961689,0.0000438473,0.1033954,0.00005942924,0.0002623188,0.000008232647,0.000001581413,0.00002770816,0.00003254446],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4925866,"threshold_uncertainty_score":0.533398,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02831864026295009,"score_gpt":0.2741303086561243,"score_spread":0.2458116683931742,"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."}}