{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00162993,0.001310351,0.001600471,0.0008571257,0.0007167944,0.001501207,0.00105309,0.001094322,0.005384565],"category_scores_gemma":[0.00277793,0.000838783,0.0008588469,0.001559937,0.0009063286,0.001882659,0.0009345631,0.001663079,0.0005877124],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00132199,"about_ca_system_score_gemma":0.001829508,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005377891,"about_ca_topic_score_gemma":0.004624336,"domain_scores_codex":[0.9992014,0.0003602908,0.00002949248,0.0001175827,0.0001645376,0.0001268038],"domain_scores_gemma":[0.9988845,0.0008645213,0.00009080957,0.00003823581,0.00006337256,0.00005859612],"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.0001895443,0.0001064538,0.0003847844,0.000205244,0.00004946286,0.0001167241,0.00008110852,0.9014239,0.001312767,0.03302133,0.002249912,0.0608588],"study_design_scores_gemma":[0.00003859464,0.0000557914,0.00008130959,0.00001188743,0.00001360305,0.00002684289,0.00002138429,0.9783447,0.0004667371,0.01959973,0.001332946,0.000006571962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02241353,0.0008657391,0.9718894,0.0002862863,0.00004864126,0.0001780004,0.0001497694,0.0001838797,0.003984689],"genre_scores_gemma":[0.2778203,0.001738989,0.7134788,0.0001064711,0.0001083133,0.0006314373,0.0005768141,0.0001991554,0.005339771],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005384565,"threshold_uncertainty_score":0.01801318,"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."}}