{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003883927,0.00006603267,0.00006613821,0.00004194886,0.0001609655,0.00006141806,0.00005842203,0.00001812607,0.00000271603],"category_scores_gemma":[0.000009582536,0.0000475064,0.000005183922,0.0002553434,0.0001395514,0.0003056581,0.000001071671,0.00004092613,2.883282e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006562871,"about_ca_system_score_gemma":0.00002066584,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000324957,"about_ca_topic_score_gemma":0.000007943318,"domain_scores_codex":[0.9995002,0.000005592808,0.00009909627,0.0001509386,0.0001199875,0.0001241826],"domain_scores_gemma":[0.9997118,0.00009239167,0.00002188296,0.00006679288,0.00005803681,0.00004908766],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.0001215209,0.00003272762,0.0329287,0.0002514535,0.00003307662,0.000002798426,0.01713081,0.632996,0.09547345,0.003888609,0.00007786271,0.217063],"study_design_scores_gemma":[0.0007357716,0.0001108025,0.5604447,0.00003719052,0.00003384678,0.000009906421,0.00008122937,0.4341531,0.00356541,0.0003456165,0.0002951769,0.0001872722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6775494,0.0001832901,0.3215188,0.0001990593,0.00001146454,0.0002967013,0.000004316721,0.00006728969,0.0001696236],"genre_scores_gemma":[0.9228811,0.00006746071,0.07691897,0.00007249648,0.000007593977,0.000008389613,0.000001480964,0.000005662807,0.00003686295],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5275159,"threshold_uncertainty_score":0.1937255,"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."}}