{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00138046,0.001097352,0.001220941,0.001046017,0.0008360187,0.001525868,0.001558304,0.001489082,0.006059391],"category_scores_gemma":[0.002920298,0.000639069,0.0006445373,0.001437896,0.0006529863,0.001619309,0.001052654,0.001565682,0.0008019453],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001623972,"about_ca_system_score_gemma":0.001988472,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006840292,"about_ca_topic_score_gemma":0.004825159,"domain_scores_codex":[0.9993411,0.0002436881,0.0000295523,0.0001041236,0.0001352846,0.0001462824],"domain_scores_gemma":[0.998952,0.000723233,0.00009948893,0.00004914132,0.0001077487,0.00006830696],"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.0003684656,0.000355168,0.0007446134,0.0001446833,0.00004885612,0.0001355289,0.0001652581,0.7773969,0.001461354,0.03303038,0.007186927,0.1789618],"study_design_scores_gemma":[0.00006049767,0.00005063753,0.00007033947,0.000009622498,0.000008021456,0.00001782369,0.00002332702,0.9898554,0.0004220642,0.0083903,0.001086148,0.000005784259],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0280522,0.0002515479,0.9641325,0.0004150272,0.00004564988,0.0002188874,0.0001945832,0.0006695523,0.006019931],"genre_scores_gemma":[0.208831,0.0002390077,0.7855435,0.0001455659,0.00005234504,0.0005218146,0.0006678876,0.0002010943,0.003797714],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006840292,"threshold_uncertainty_score":0.02027065,"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."}}