{"id":"W2033271291","doi":"10.1016/j.cor.2009.08.003","title":"Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading","year":2009,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":41,"is_retracted":false,"has_abstract":false,"ca_institutions":"HEC Montréal","funders":"Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Travelling salesman problem; Pickup; Branch and cut; FIFO (computing and electronics); Mathematical optimization; Computer science; 2-opt; Traveling purchaser problem; Branch and bound; Bottleneck traveling salesman problem; Algorithm; Combinatorial optimization; Mathematics; Integer programming; Artificial intelligence","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.0008424767,0.000100988,0.0001096914,0.0001113415,0.0006511332,0.0003372933,0.0001456801,0.00004523338,0.000003328749],"category_scores_gemma":[0.00004197579,0.00007725584,0.00001664729,0.0002858937,0.00008146104,0.0001666548,0.00003576103,0.0002466738,0.000001866631],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004203065,"about_ca_system_score_gemma":0.0000386267,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001425114,"about_ca_topic_score_gemma":0.00003597131,"domain_scores_codex":[0.9991117,0.00009172402,0.0001527322,0.0001960467,0.0001711941,0.0002765809],"domain_scores_gemma":[0.9990796,0.0004888178,0.000006200229,0.0001735702,0.0001797499,0.00007209975],"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.000009273736,0.000008633178,0.00009798777,0.00003235048,0.00002587793,9.67104e-7,0.001255224,0.9187759,0.002018023,0.001333252,0.0003078874,0.07613466],"study_design_scores_gemma":[0.0003744802,0.0001164084,0.001153694,0.00006195624,0.00000830968,0.00001565442,0.00009902476,0.9967667,0.0008069534,0.00008480732,0.0004072106,0.0001048382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1311042,0.0004346184,0.8664597,0.001077389,0.00003998089,0.0005922666,0.000002870714,0.0001042694,0.0001846777],"genre_scores_gemma":[0.7338694,0.0001663022,0.2656736,0.00006424826,0.00008513201,0.00003848555,0.000005855192,0.00001865698,0.0000783225],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6027652,"threshold_uncertainty_score":0.5008056,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05253349140854373,"score_gpt":0.3315060262539176,"score_spread":0.2789725348453738,"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."}}