{"id":"W4247344008","doi":"10.1002/net.20312","title":"A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading","year":2009,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":82,"is_retracted":false,"has_abstract":true,"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"FIFO and LIFO accounting; Travelling salesman problem; Pickup; Computer science; Traveling purchaser problem; Mathematical optimization; Branch and cut; Algorithm; Mathematics; Set (abstract data type); Bottleneck traveling salesman problem; Integer programming; FIFO (computing and electronics); Artificial intelligence","routes":{"ca_aff":true,"ca_fund":true,"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.0003159275,0.0001355245,0.0001410955,0.00002532651,0.0001639445,0.00007949559,0.00006946672,0.00008518613,0.000002168882],"category_scores_gemma":[0.000007549956,0.0001027864,0.00002187294,0.0001237785,0.00002815105,0.00008091085,0.0000113056,0.0001839063,3.150585e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001778573,"about_ca_system_score_gemma":0.00000711371,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003270714,"about_ca_topic_score_gemma":0.000006997579,"domain_scores_codex":[0.9993536,0.0000229176,0.0001470705,0.0001589231,0.00006843976,0.0002490218],"domain_scores_gemma":[0.9995255,0.0002415733,0.00002898723,0.0001138841,0.00003260714,0.00005744818],"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.000006425662,0.000002447893,0.0001223544,0.00001058397,0.00002141134,6.701829e-7,0.0002007967,0.5603572,0.00002906589,0.00005423289,0.00007423505,0.4391206],"study_design_scores_gemma":[0.0004501436,0.00006244604,0.000962589,0.00007873185,0.00004061684,0.00002171387,0.00003241767,0.9975749,0.00005224801,0.0001077442,0.0004726326,0.0001438396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01040482,0.002013888,0.9866517,0.000120036,0.00007440209,0.0003166494,0.000001507218,0.0001924255,0.0002245671],"genre_scores_gemma":[0.586503,0.0005004982,0.4123533,0.000176166,0.000361361,0.00002195438,0.000004033743,0.00003745404,0.00004225341],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5760982,"threshold_uncertainty_score":0.4191508,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01020951840310678,"score_gpt":0.2203514951380027,"score_spread":0.210141976734896,"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."}}