{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003755639,0.00170893,0.003042837,0.001660025,0.001482848,0.002995643,0.002555663,0.002810797,0.01198475],"category_scores_gemma":[0.007475007,0.00168582,0.00127546,0.002757094,0.001504109,0.00363344,0.001514972,0.002923548,0.001119864],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00313838,"about_ca_system_score_gemma":0.004009819,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0177617,"about_ca_topic_score_gemma":0.01039498,"domain_scores_codex":[0.9988212,0.0004534287,0.00004744728,0.0001501895,0.0002651939,0.0002625962],"domain_scores_gemma":[0.9964207,0.002851207,0.0001986914,0.0001082066,0.0002098167,0.0002113673],"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.0004971109,0.0003045625,0.0005161358,0.0002976666,0.00006614866,0.00009522818,0.00009726877,0.8919811,0.0005028197,0.03925154,0.006564532,0.05982589],"study_design_scores_gemma":[0.00006697714,0.00006521555,0.0001301443,0.00002122131,0.00002262891,0.00001736091,0.00002858187,0.9660137,0.0001935731,0.03254358,0.0008859424,0.00001096676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0529603,0.001941501,0.9245587,0.001872685,0.0002420241,0.0004880627,0.0008215558,0.0006820196,0.01643318],"genre_scores_gemma":[0.4457384,0.002886813,0.5213846,0.0003312282,0.0003925417,0.0009111584,0.001616652,0.0004575737,0.02628111],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0177617,"threshold_uncertainty_score":0.04009295,"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."}}