{"id":"W2119097848","doi":"10.1287/trsc.1090.0272","title":"Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows","year":2009,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":462,"is_retracted":false,"has_abstract":true,"ca_institutions":"HEC Montréal","funders":"","keywords":"Column generation; Pickup; Mathematical optimization; Set (abstract data type); Branch and cut; Relaxation (psychology); Linear programming relaxation; Lagrangian relaxation; Computer science; Path (computing); Integer programming; Linear programming; Shortest path problem; Branch and price; Vehicle routing problem; Column (typography); Mathematics; Routing (electronic design automation); Theoretical 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002761626,0.001510949,0.001454093,0.001072482,0.0009632545,0.002171499,0.001221931,0.001568153,0.008339729],"category_scores_gemma":[0.005771148,0.001007996,0.0009848014,0.002121234,0.001183659,0.003266426,0.001176827,0.003376141,0.0009445466],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001986709,"about_ca_system_score_gemma":0.00236851,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005807045,"about_ca_topic_score_gemma":0.005661741,"domain_scores_codex":[0.9988907,0.0004792873,0.00004220205,0.0001386231,0.0002933465,0.0001558651],"domain_scores_gemma":[0.9973282,0.002217482,0.0001380711,0.00008319155,0.0001478869,0.00008519931],"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.0003486796,0.0001654791,0.0005905412,0.0002982766,0.00007196159,0.0001956714,0.0001457787,0.6558555,0.002124065,0.184007,0.006503978,0.1496931],"study_design_scores_gemma":[0.00004561171,0.00007508999,0.0001195148,0.00002154668,0.00002038103,0.00004715887,0.00002435385,0.9302652,0.0007401511,0.06610714,0.002522007,0.00001186117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01488439,0.0008208994,0.978522,0.000441834,0.00007222658,0.000160879,0.0001070962,0.0002053263,0.004785365],"genre_scores_gemma":[0.1844822,0.001871499,0.8043836,0.0001881749,0.0001548016,0.0005467353,0.0005857067,0.0002951708,0.007492225],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008339729,"threshold_uncertainty_score":0.02789921,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01091285829767171,"score_gpt":0.2396820738027333,"score_spread":0.2287692155050615,"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."}}