{"id":"W2078227935","doi":"10.1287/opre.1090.0713","title":"Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows","year":2009,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":198,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Column generation; Vehicle routing problem; Knapsack problem; Mathematical optimization; Computer science; Relaxation (psychology); Integer programming; Routing (electronic design automation); Branch and price; Shortest path problem; Set (abstract data type); Bounded function; Mathematics; Computer network","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.001559526,0.000108902,0.0001207894,0.0001033816,0.0007565379,0.0003230728,0.000149342,0.00006100952,0.0000353152],"category_scores_gemma":[0.0001608131,0.0000788769,0.00001950158,0.0004065693,0.0000812252,0.0002279393,0.00004233787,0.0002974216,0.00001920171],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005201776,"about_ca_system_score_gemma":0.00005501498,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000293121,"about_ca_topic_score_gemma":0.00002235399,"domain_scores_codex":[0.9988745,0.0001276438,0.0001780105,0.0002097274,0.0002496236,0.0003605163],"domain_scores_gemma":[0.9989249,0.0005055119,0.000008233385,0.0002396402,0.0002412758,0.00008041688],"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.00003084413,0.00002568037,0.000290363,0.00003625779,0.00004638447,0.000001214543,0.001281029,0.9149184,0.02055383,0.004380065,0.0005323803,0.05790351],"study_design_scores_gemma":[0.0004271638,0.0001261366,0.001837648,0.00003098906,0.000009850473,0.000009273521,0.00009307171,0.9947408,0.00172491,0.00009390914,0.0007900855,0.0001160918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6583716,0.0009707982,0.3207959,0.007080074,0.00005179765,0.003215039,0.00002658048,0.0004652498,0.009022999],"genre_scores_gemma":[0.9147499,0.0001266147,0.08312275,0.00007455114,0.0001060676,0.0001266598,0.000008581334,0.00003417528,0.001650705],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2563783,"threshold_uncertainty_score":0.5818754,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03652744760081844,"score_gpt":0.3253852390021137,"score_spread":0.2888577914012953,"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."}}