{"id":"W2156398306","doi":"10.1002/net.21459","title":"A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks","year":2012,"lang":"en","type":"article","venue":"Networks","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal; Polytechnique Montréal; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Travelling salesman problem; Pickup; Stack (abstract data type); Computer science; Constraint (computer-aided design); Algorithm; 2-opt; Branch and cut; Mathematical optimization; Mathematics; Integer programming; 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.0001524062,0.0001162765,0.0001019796,0.00001667253,0.0001272438,0.00005300264,0.00004560814,0.00007257239,0.00000646599],"category_scores_gemma":[0.000002745695,0.00008166702,0.00001746577,0.00006877643,0.00003284804,0.000109772,0.00001379647,0.0001331644,9.114106e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009568793,"about_ca_system_score_gemma":0.000004377212,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009905557,"about_ca_topic_score_gemma":0.00005111948,"domain_scores_codex":[0.9994696,0.00001008784,0.0001066691,0.00009528684,0.0000549569,0.000263407],"domain_scores_gemma":[0.9996274,0.0001633427,0.0000208753,0.00009210443,0.00002497861,0.000071292],"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.00001382237,0.00001153555,0.007621985,0.00005732895,0.0000775513,2.568064e-7,0.001220793,0.7233991,0.00000970682,0.0001046059,0.0006722231,0.2668111],"study_design_scores_gemma":[0.0005849453,0.00002623317,0.001527898,0.00004601428,0.00003163192,0.000009899257,0.00005226224,0.9897737,0.00001931021,0.00001620957,0.007776457,0.0001354603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008639148,0.004132618,0.986077,0.00003900324,0.0001938593,0.0004246899,0.000006354075,0.0001423931,0.0003449249],"genre_scores_gemma":[0.9612876,0.0007616492,0.03734316,0.00009211872,0.0003051438,0.00005974834,0.00001456899,0.00004138806,0.00009465381],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9526484,"threshold_uncertainty_score":0.3330284,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01037015660828235,"score_gpt":0.1923077332894443,"score_spread":0.1819375766811619,"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."}}